Flow shop vs. permutation shop with time delays

Computers and Industrial Engineering

Volumn 48, Issue 2, 2005, Pages 357-362

  Rebaine, D ^a  

^a UNIVERSITÉ DU QUÉBEC À CHICOUTIMI   (Canada)

Author keywords

Flow shop; Makespan; Permutation schedules

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING; THEOREM PROVING;

FLOW SHOP; MAKESPAN; PERMUTATION SCHEDULES; PERMUTATION SHOP;

MACHINE SHOPS;

EID: 14044252063     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2005.01.019     Document Type: Article

References (6)

1. M. Dell'Amico Shop problems with two machines and time lags Operation Research 44 1996 777 787
2. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
3. M. Pinedo Scheduling: theory, algorithms, and systems 2nd ed 1995 Prentice Hall Englewood cliffs, NJ
4. C.N. Potts, D.S. Shmoys, and D.P. Williamson Permutation vs. non-permutation flow shop schedules Operations Research Letters 10 1991 281 284
5. V.J. Rayward-Smith, and D. Rebaine UET flow shop scheduling problem Theoretical Informatics and its Applications 30 1997 23 30
6. Yu, W. (1996). The two-machine flow shop with delays and the one machine total tardiness problem. PhD Thesis, Department of Mathematics and Computing, Eindhoven University of Technology, The Netherlands.