A permutation flow-shop scheduling problem with convex models of operation processing times

@article{Cheng2000APF,
  title={A permutation flow-shop scheduling problem with convex models of operation processing times},
  author={T. C. Edwin Cheng and Adam Janiak},
  journal={Annals OR},
  year={2000},
  volume={96},
  pages={39-60}
}
The paper is an extension of the classical permutation flow-shop scheduling problem to the case where some of the job operation processing times are convex decreasing functions of the amounts of resources (e.g., financial outlay, energy, raw material) allocated to the operations (or machines on which they are performed). Some precedence constraints among the jobs are given. For this extended permutation flow-shop problem, the objective is to find a processing order of the jobs (which will be… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

A comparative study of flow-shop algorithms

  • K. R. Baker
  • Opns. Res. 23(62)
  • 1975
Highly Influential
5 Excerpts

Optimization

  • E. Polak
  • Algorithms and Consistent Approximation
  • 1997

G

  • J. Blazewicz, K. H. Ecker, E. Pesch
  • Schmidt and J. Weglarz, Scheduling Computer and…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…