A note on the complexity of flow shop scheduling with transportation constraints

European Journal of Operational Research

Volumn 178, Issue 3, 2007, Pages 918-925

  Yuan, Jinjiang ^a   Soukhal, Ameur ^b   Chen, Youjun ^a   Lu, Lingfa ^a  

^a ZHENGZHOU UNIVERSITY   (China)

^b UNIVERSITÉ DE TOURS   (France)

Author keywords

Complexity; Flow shop; Scheduling; Transportation

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

FLOW SHOP; TRANSPORTATION CONSTRAINTS; TRANSPORTATION TIME;

TRANSPORTATION;

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

References (7)

1. Ahmadi J.H., Ahmadi R.H., Dasu S., and Tang C.S. Batching and scheduling jobs on batch and discrete processors. Operations Research 39 (1992) 750-763
2. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
3. Graham R.L., Lawler E.l., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
4. Hall N.G., and Sriskandarajah H. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44 3 (1996) 510-525
5. Lee C.-Y., and Chen Z.-L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
6. Potts C.N., Strusevich V.A., and Tautenhahn T. Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling 4 (2001) 25-51
7. Soukhal A., Oulamara A., and Martineau P. Complexity of flow shop scheduling problems with transportation constraints. European Journal of Operational Research 161 (2005) 32-41