Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Computers and Operations Research

Volumn 36, Issue 1, 2009, Pages 60-72

  S Sakuraba, Celso ^a   Ronconi, Débora P ^a   Sourd, Francis ^b  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Common due date; Earliness and tardiness; Flowshop; Heuristics; Scheduling

Indexed keywords

HEURISTIC METHODS; HEURISTIC PROGRAMMING; SCHEDULING; SET THEORY;

(PL) PROPERTIES; BENCH-MARK PROBLEMS; COMPUTATIONAL EXPERIMENTS; DUE DATES; ELSEVIER (CO); FLOW SHOP SCHEDULING PROBLEM; FLOW SHOPS; JOB SEQUENCING; MEAN ABSOLUTE DEVIATION (MAD); OPTIMAL SCHEDULING; PAPER ADDRESSES;

SCHEDULING ALGORITHMS;

EID: 44949130567     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.07.005     Document Type: Article

References (23)

1. Sen T., and Gupta S.K. A state-of-art survey of scheduling research involving due dates. OMEGA 12 (1984) 63-76
2. Biskup D., and Feldmann M. Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Computers & Operations Research 28 8 (2001) 787-801
3. Sarper H. Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem. Applied Mathematical Modelling 19 3 (1995) 153-161
4. Baker K.R., and Scudder G.D. Sequencing with earliness and tardiness penalties: a review. Operations Research 38 1 (1990) 22-36
5. Gordon V., Proth J., and Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139 1 (2002) 1-25
6. Kanet J.J. Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly 28 (1981) 643-651
7. Bagchi U., Sullivan R.S., and Chang Y. Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly 33 (1986) 227-240
8. Sung C.S., and Min J.I. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. European Journal of Operational Research 131 1 (2001) 95-106
9. Yeung W.K., Oguz C., and Cheng T.C.E. Two-stage flowshop earliness and tardiness machine scheduling involving a common due window. International Journal of Production Economics 90 3 (2004) 421-434
10. Nawaz M., Enscore Jr. E., and Ham I. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11 1 (1983) 91-95
11. Feldmann M., and Biskup D. Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristics approaches. Computers & Industrial Engineering 44 2 (2003) 307-323
12. Hall N.G., Kubiak W., and Sethi S.P. Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date. Operations Research 39 5 (1991) 847-856
13. Kim Y.D. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 3 (1995) 541-555
14. Wagner H.M. An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly 6 (1959) 131-140
15. Stafford Jr. E.F., Tseng F.T., and Gupta J.N.D. Comparative evaluation of MILP flowshop models. Journal of Operational Research Society 56 1 (2005) 88-101
16. Hendel Y., and Sourd F. An improved earliness-tardiness timing algorithm. Computers & Operations Research 34 10 (2007) 2931-2938
17. Chrétienne Ph., and Sourd F. Scheduling with convex cost functions. Theoretical Computer Science 292 (2003) 145-164
18. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 2 (1993) 278-285
19. Lauff V., and Werner F. On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties. Computers & Operations Research 31 (2004) 317-345
20. Kim Y.D. Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society 44 1 (1993) 18-19
21. Ronconi D.P. A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 87 1 (2004) 39-48
22. Johnson S.M. Optimal two and three stage production schedules with set-up times included. Naval Research Logistics Quarterly 1 (1954) 61-68
23. Lin S.W., Chou S.Y., and Ying K.C. A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date. European Journal of Operational Research 177 (2007) 1294-1301