Two-machine flow shop scheduling problems with minimal and maximal delays

4OR

Volumn 4, Issue 1, 2006, Pages 15-28

  Bouquard, Jean Louis ^a   Lenté, Christophe ^a  

^a UNIVERSITÉ DE TOURS   (France)

Author keywords

Branch and bound procedure; Flow shop; Max Plus algebra

Indexed keywords

EID: 33644954795     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-005-0069-7     Document Type: Article

References (17)

1. Baccelli F, Cohen G, Olsder G, Quadrat JP (1992) Synchronisation and Linearity: An Algebra for Discrete Event Systems, Wiley, New York
2. Bouquard J-L, Billaut J-C., Kubzin MA, Strusevich VA (2003) Two-machine flow shop scheduling problems with no-wait jobs. Operations Research Letter (forthcoming)
3. Bouquard J-L, Lenté C, Billaut J-C (2003) Application of an optimization problem in Max-Plus algebra to scheduling problems. Discrete Applied Mathematics (forthcoming)
4. Cetinkaya FC (1993) Lot streaming in a two stage flow shop with setup, processing and removal times separated. Journal of Operational Research Society 45: 1445-1455
5. Dell'Amico M (1996) Shop problems with two machines and time lags. Operations Research 44(5): 777-787
6. Fondrevelle J-L, Oulamara C, Portmann M-C (2005) Permutation flowshop scheduling problems with maximal and minimal time lags. Computers & Operations Research (forthcoming)
7. Giffler B (1963) Schedule algebras and their use in formulating general systems simulations. In: Muth F, Thompson GL (eds) Industrial scheduling. Prentice Hall, New Jersey, USA
8. Gilmore PC, Gomory RE (1964) Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research 12:655-679
9. Gunawardena J (1998) Idempotency. Newton Institute, Cambridge University Press
10. Hanen C, Munier A (1995) Scheduling theory and its applications. In: Chretienne P, Coffman E, Lenstra J, Liu Z (eds) Cyclic scheduling on parallel processors: an overview. Wiley, New York, pp 193-226
11. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res. Log. Quart. 1: 61-68
12. Mitten LG (1959) Sequencing n jobs on two machines with arbitrary time lags. Management Science 5(3): 293-298
13. Sahni S, Cho Y (1979) Complexity of scheduling shops with no wait in process. Mathematics of Operations Research 4(4): 448-457
14. Su L-H (2002) A hybrid two-stage flowshop with limited waiting time constraints. Computers & Industrial Engineering (forthcoming)
15. Sule DR, Huang KY (1983) Sequency on two and three machines with setup, processing and removal times separated. IJPR, International Journal of Production Research 21(5): 723-732
16. Yang D-L, Chern M-S (1995) A two-machine flowshop sequencing problem with limited waiting time constraints. Computers & Industrial Engineering 28(1): 63-70
17. Yurdakul M, Ordrey NG (2004) Development of a new dioid algebraic model for manufacturing with the scheduling decision making capability. Robotics & Autonomous Systems 49: 207-218