Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness

International Journal of Production Economics

Volumn 122, Issue 2, 2009, Pages 763-773

  Moslehi, G ^a   Mirzaee, M ^a   Vasei, M ^a   Modarres, M ^b   Azaron, A ^c,d  

^a ISFAHAN UNIVERSITY OF TECHNOLOGY   (Iran)

^b SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^c UNIVERSITY COLLEGE DUBLIN   (Ireland)

^d UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Branch and bound; Flow shop; Just in time (JIT) systems; Scheduling

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND; DIFFERENT SIZES; DOMINANT SET; FLOW SHOP; FLOW-SHOP SCHEDULING; FLOW-SHOPS; JUST-IN-TIME; JUST-IN-TIME (JIT) SYSTEMS; LARGE-SCALE PROBLEM; MAXIMUM EARLINESS; OBJECTIVE FUNCTIONS; OPTIMAL SCHEDULING; OPTIMAL SOLUTIONS; PRODUCTION SYSTEM; UPPER AND LOWER BOUNDS;

ALGORITHMS; CONTROL THEORY; JUST IN TIME PRODUCTION; MACHINE SHOP PRACTICE; OPTIMAL SYSTEMS; PROBLEM SOLVING;

BRANCH AND BOUND METHOD;

EID: 70350566536     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2009.07.003     Document Type: Article

References (19)

1. Amin-Nayeri, M.R., Moslehi, G., 2000. Optimal algorithm for single machine sequencing to minimize early/tardy cost, Esteghlal, Isfahan University of Technology, 1, 35-48.
2. Amin-Nayeri M.R., and Moslehi G. Optimal algorithm for flow shop sequencing to minimize early/tardy cost. International Journal of Engineering Sciences 12 (2001) 191-209
3. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, New York
4. Bertrand M.T. Scheduling in the two machine flow shop with due date constraint. Introduction Journal of Production Economics 70 (2001) 117-123
5. French S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop (1986), Ellis Horwood Limited, Chichester
6. Johnson S.M. Optimal two and three stage production schedule with set-up time included. Naval Research Logistics Quarterly 1 (1954) 61-68
7. Koulamas C. On the complexity of two-machine flow shop problems with due date related objectives. European Journal of Operational Research 106 (1998) 95-100
8. Koulamas C. A guaranteed accuracy shifting bottleneck algorithm for the two machine flow shop and tardiness problem. Computers and Operations Research 25 (1998) 83-89
9. Ladhari T., and Hauari M. Minimizing maximum lateness in a two machine flow shop. Journal of the Operational Research Society 51 (2000) 1100-1106
10. Lee C., and Chou F. Two machine flow shop scheduling with bi-criteria problem. Computers and Industrial Engineering 36 (1999) 549-564
11. Min J.I., and Sung C.S. Scheduling in a two machine flow shop with batch processing machine(s) for earliness/tardiness measure under a common due date. European Journal of Operational Research 131 (2001) 95-106
12. Nawaz M., Enscorejr E., and Ham I. A heuristic algorithm for m-machine and n-job flow-shop sequencing problem. Omega 11 (1983) 91-95
13. Ow P.S., and Morton T.E. The single machine early/tardy problem. Management Science 35 (1989) 177-191
14. Pan J.C.H., and Fan E.T. Two machine flow shop scheduling to minimizing total tardiness. International Journal of Systems Science 28 (1997) 405-414
15. Pan J., Chen J., and Chao C. Minimizing tardiness in a two machine flow shop. Computers and Operations Research 29 (2002) 869-885
16. Tapan sen K., and Dilpen P. Job lateness in a two machine flow shop with set up time separated. Computers and Operations Research 18 (1991) 549-556
17. Tavakkoli-Moghaddam R., Moslehi G., Vasei M., and Azaron A. Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. Applied Mathematics and Computation 167 (2005) 1430-1450
18. Tavakkoli-Moghaddam R., Moslehi G., Vasei M., and Azaron A. A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. Applied Mathematics and Computation 174 (2006) 388-408
19. Zegordi S.H., Itoh K., and Enkawa T. A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem. International Journal of Production Research 33 (1995) 1449-1466