Minimising maximum lateness in a two-machine flowshop

Journal of the Operational Research Society

Volumn 51, Issue 9, 2000, Pages 1100-1106

  Haouari, M ^a   Ladhari, T ^b  

^a UNIVERSITY OF CARTHAGE   (Tunisia)

^b UNIVERSITY OF TUNIS   (Tunisia)

Author keywords

Branch and bound; Lateness; Permutation flowshop; Scheduling

Indexed keywords

BRANCH-AND-BOUND METHODS; PERMUTATION FLOWSHOPS; TWO-MACHINE FLOWSHOPS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; PROCESS ENGINEERING; PRODUCTION CONTROL; RANDOM NUMBER GENERATION; RELAXATION PROCESSES; SCHEDULING;

OPERATIONS RESEARCH;

EID: 0034348297     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600065     Document Type: Article

References (18)

1. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In: Graves CG, Rinnooy Kan AHG and Zipkin P (eds) Handbooks in Operations Research and Management Sciences, Vol 4: Logistics of Production and Inventory. North-Holland: Amsterdam, pp 445-522.
2. Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Annals of Dis Math 1: 343-362.
3. Johnson SM (1954). Optimal two-and three-stage production schedules with setup times. Naval Res Logist Q 1: 61-68.
4. Mitten LG (1958). Sequencing n jobs on two machines with arbitrary time lags. Mgmt Sci 5: 293-298.
5. Grabowski J (1980). On two-machine scheduling with release dates to minimize maximum lateness. Opsearch 17: 133-154.
6. Potts CN (1985). Analysis of heuristics for two-machine flow shop sequencing subject to release dates. Math Opns Res 10: 577-584.
7. Hall LA (1994). A polynomial approximation scheme for a constrained flow-shop scheduling problem. Math Opns Res 19: 68-85.
8. Kovalyov MY and Werner F (1997). A polynomial approximation scheme for problem F2\rj Cmax. Opns Res Lett 20: 75-79.
9. Tadei R, Della Croce F and Cortesi M (1998). Minimising makespan in the two-machine flow-shop with release times. J Opl Res Soc 49: 77-85.
10. Sen T and Raiszadeh FME (1996). Branch-and-Bound approach to minimise total flow-time and maximum lateness in the two- machine scheduling system. Proceedings of the 1996 27th Annual Meeting of the Decision Sciences Institute, Vol 3. Decision Sciences Institute, Atlanta, GA, p 1339.
11. Stevens JW and Gemmill DD (1997). Scheduling a two- machine flowshop with travel times to minimise lateness. Int J Prod Res 35: 1-15.
12. Allahverdi A and Aldowaisan T (1998). Job lateness in flow- shops with setup and removal times separated. J Opl Res Soc 49: 1001-1006.
13. Lageweg BJ, Lenstra JK and Rinnooy Kan AHG (1978). A general bounding scheme for the permutation flow-shop problem. Opns Res 26: 53-67.
14. Potts CN (1980). An adaptive branching rule for the permutation flow-shop problem. Eur J Opl Res 5: 19-25.
15. Carlier J and Rebai Ï (1996). Two branch and bound algorithms for the permutation flow shop problem. Eur J Opl Res 90: 238-251.
16. Bellman R, Esogbue AO and Nabeshima I (1982). Mathematical Aspects of Scheduling and Applications. Pergamon Press: Oxford, p 202.
17. Horn WA (1974). Some simple scheduling algorithms. Naval Res Logist Q 21: 177-185.
18. Carlier J (1982). The one-machine sequencing problem. Eur J Opl Res 11: 42-47.