Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution
Published Online:1 May 1977https://doi.org/10.1287/mnsc.23.9.1016
- Cited by
- Expert Systems with Applications, Vol. 158
- A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs8 August 2014 | International Journal of Systems Science: Operations & Logistics, Vol. 1, No. 2
- European Journal of Operational Research, Vol. 199, No. 2
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardinessComputers & Operations Research, Vol. 36, No. 4
- 1 October 2005 | The International Journal of Advanced Manufacturing Technology, Vol. 29, No. 11-12
- International Journal of Production Economics, Vol. 99, No. 1-2
- International Journal of Production Research, Vol. 43, No. 14
- 21 February 2007 | International Journal of Production Research, Vol. 42, No. 19
- Journal of Combinatorial Optimization, Vol. 8, No. 3
- 21 February 2007 | International Journal of Production Research, Vol. 42, No. 4
- Computers & Operations Research, Vol. 31, No. 2
- Journal of Information and Optimization Sciences, Vol. 24, No. 1
- Journal of the Chinese Institute of Industrial Engineers, Vol. 18, No. 6
- Gestão & Produção, Vol. 7, No. 3
- International Journal of Production Economics, Vol. 65, No. 2
- International Journal of Production Economics, Vol. 64, No. 1-3
- European Journal of Operational Research, Vol. 109, No. 1
- European Journal of Operational Research, Vol. 106, No. 1
- International Journal of Systems Science, Vol. 28, No. 4
- Journal of Information and Optimization Sciences, Vol. 18, No. 1
- International Journal of Production Research, Vol. 34, No. 6
- European Journal of Operational Research, Vol. 91, No. 1
- IFAC Proceedings Volumes, Vol. 28, No. 24
- European Journal of Operational Research, Vol. 85, No. 3
- IFAC Proceedings Volumes, Vol. 28, No. 16
- Applied Mathematical Modelling, Vol. 19, No. 3
- Computers & Operations Research, Vol. 20, No. 4
- Computers & Operations Research, Vol. 18, No. 6
- Computers & Operations Research, Vol. 16, No. 4
- European Journal of Operational Research, Vol. 38, No. 2
- International Journal of Physical Distribution & Materials Management, Vol. 10, No. 3
Volume 23, Issue 9
May 1977
Pages 913-1035
Article Information
Metrics
Information
- Published Online:May 01, 1977
© 1977 INFORMS
Cite as
W. Townsend, (1977) Note—Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution. Management Science 23(9):1016-1019.
https://doi.org/10.1287/mnsc.23.9.1016
