Johnson's rule, composite jobs and the relocation problem

@article{Cheng2009JohnsonsRC,
  title={Johnson's rule, composite jobs and the relocation problem},
  author={T. C. Edwin Cheng and Bertrand M. T. Lin},
  journal={European Journal of Operational Research},
  year={2009},
  volume={192},
  pages={1008-1013}
}
Two-machine flowshop scheduling to minimize makespan is one of the most well-known classical scheduling problems. Johnson's rule for solving this problem has been widely cited in the literature. We introduce in this paper the concept of composite job, which is an artificially constructed job with processing times such that it will incur the same amount of idle time on the second machine as that incurred by a chain of jobs in a given processing sequence. This concept due to Kurisu first appeared… CONTINUE READING
BETA

References

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

A review on flowshop

P. Brucker
  • 2007
VIEW 1 EXCERPT

The simple F

M. Pinedo
  • 2001
VIEW 1 EXCERPT

A review on flowshop scheduling research with setup times

J. N. D. Gupta, G. Wang
  • Production and Operations Management
  • 2000

Similar Papers

Loading similar papers…