Johnson's rule, composite jobs and the relocation problem

European Journal of Operational Research

Volumn 192, Issue 3, 2009, Pages 1008-1013

  Cheng, T C E ^a   Lin, B M T ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Composite job; Flowshop; Johnson's rule; Makespan; Relocation problem

Indexed keywords

COMPOSITE JOB; FLOWSHOP; JOHNSON'S RULE; MAKESPAN; RELOCATION PROBLEM;

PROBLEM SOLVING;

EID: 51649107577     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.11.035     Document Type: Article

References (17)

1. Birman M., and Mosheiov G. A note on a due-date assignment on a two-machine flow-shop. Computers and Operations Research 31 (2004) 473-480
2. Brucker P. Scheduling Algorithms (2007), Springer, New York
3. Cheng T.C.E., Gupta J.N.D., and Wang G. A review on flowshop scheduling research with setup times. Production and Operations Management 9 (2000) 262-282
4. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 87-326
5. Johnson S.M. Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
6. Kamburowski J. The nature of simplicity of Johnson's Algorithm. Omega 25 (1997) 581-584
7. Kamburowski J. Non-bottleneck machines in three-machine flow shops. Journal of Scheduling 3 (2000) 209-223
8. Kaplan E.H. Relocation models for public housing redevelopment programs. Planning and Design 13 (1986) 5-19
9. Kaplan E.H., and Amir A. A fast feasibility test for relocation problems. European Journal of Operational Research 35 (1988) 201-205
10. Kaplan E.H., and Berman O. Orient heights housing projects. Interfaces 18 (1988) 14-22
11. Kononov A.V., and Lin B.M.T. On the relocation problems with multiple identical working crews. Discrete Optimization 21 (2006) 368-381
12. Kononov, A.V., Lin, B.M.T., Resource-constrained scheduling to minimize weighted completion time on a single machine, submitted for publication.
13. Kurisu T. Two-machine scheduling under required precedence among jobs. Journal of the Operations Research Society of Japan 19 (1976) 1-13
14. PHRG. New lives for old buildings: revitalizing public housing project. Public Housing Group, Department of Urban Studies and Planning (1986), MIT, Cambridge, Massachusetts
15. Pinedo M. Scheduling: Theory, Algorithms, and Systems (2001), Prentice-Hall, New Jersey
16. max with forbidden tasks in first or last position: a problem more complex than it seems. European Journal of Operational Research 161 (2005) 21-31
17. Sekiguchi Y. Optimal schedule in a GT-type flow-shop under series-parallel precedence constraints. Journal of the Operations Research Society of Japan 26 (1983) 226-251