Permutation flow shop scheduling with earliness and tardiness penalties

International Journal of Production Research

Volumn 47, Issue 20, 2009, Pages 5591-5610

  Chandra, Pankaj ^a   Mehta, Peeyush ^b   Tirupati, Devanath ^c  

^a INDIAN INSTITUTE OF MANAGEMENT BANGALORE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^c INDIAN INSTITUTE OF MANAGEMENT   (India)

Author keywords

Common due date; Earliness; Flow shop; Tardiness

Indexed keywords

ANALYTICAL RESULTS; BULK DRUGS; CHARACTERISATION; COMMON DUE DATE; COMPUTATIONAL RESULTS; DUE DATES; EARLINESS; EARLINESS AND TARDINESS PENALTIES; FLOW SHOP; OPTIMAL SOLUTIONS; PERMUTATION FLOW-SHOP SCHEDULING; PRODUCTION PLANNING AND SCHEDULING; SCHEDULING MODULE; SINGLE MACHINE PROBLEMS; TARDINESS;

MACHINE SHOP PRACTICE; OPTIMAL SYSTEMS; PLANNING; PRODUCTION CONTROL; SCHEDULING;

PROBLEM SOLVING;

EID: 70449597987     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802124301     Document Type: Article

References (32)

1. Adams, J., Balas, E., and Zawack, D., 1988. The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.
2. Ahmadi, R.H. and Bagchi, U., 1990. Improved lower bounds for minimising the sum of completion times of n jobs over m machines in a flowshop. European Journal of Operational Research, 44, 331-336.
3. Bagchi, U., Sullivan, R., and Chang, Y., 1986. Minimising mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly, 33, 227-240.
4. Baker, K.R. and Scudder, G.D., 1990. Sequencing with earliness and tardiness penalties: a review. Operations Research, 38 (1), 22-36.
5. Ben-Daya, M. and Al-Fawzan, M., 1998. A tabu search approach for the flow shop scheduling problem. European Journal of Operational Research, 109, 88-95.
6. Biskup, D. and Feldmann, M., 2005. On scheduling around large restrictive common due windows. European Journal of Operational Research, 162, 740-761.
7. Cheng, T.C.E. and Kahlbacher, H.G., 1991. A proof of the longest-first job policy in one machine scheduling. Naval Research Logistics Quarterly, 38, 715-720.
8. Chu, C. and Portmann, M.C., 1992. Some new efficient methods to solve n/1/ri/ P Ti scheduling problem. European Journal of Operational Research, 58, 404-413.
9. Garey, M., Johnson, D., and Sethi, R., 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117-129.
10. Gordon, V., Proth, J.M., and Chu, C., 2002. A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 21-25.
11. Gowrishankar, K., Rajendran, C., and Srinivasan, G., 2001. Flowshop scheduling algorithms for minimising the completion time variance and the sum of squares of completion time deviations from a common due date. European Journal of Operational Research, 132, 643-665.
12. Gupta, J.N.D., Hennig, K., and Werner, F., 2002. Local search heuristics for two stage flow shop problems with secondary criterion. Computers and Operations Research, 29, 123-149.
13. Graves, S., 1981. A review of production scheduling. Operations Research, 29 (4), 646-675.
14. Hall, N., Kubiak, W., and Sethi, S., 1991. Earliness-tardiness scheduling problems II: deviation of completion times about a restrictive common due date. Operations Research, 39, 847-856. (Pubitemid 23585546)
15. Kanet, J., 1981. Minimising the average completion of job completion times about a common due date. Naval Research Logistics Quarterly, 28, 643-651.
16. Kanet, J. and Sridharan, V., 2000. Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99-110.
17. Koulamas, C., 1994. The total tardiness problem: review and extensions. Operations Research, 42 (6), 1025-1041.
18. Lageweg, B.J., Lenstra, J.K., and Rinnooy Kan, A.H.G., 1978. A general bounding scheme for the permutation flow-shop problem. Operations Research, 26 (1), 53-67.
19. Lakshminarayan, S., et al., 1978. Optimal single machine scheduling with earliness and tardiness penalties. Operations Research, 26, 1079-1082.
20. Lin, S.W., Chou, S.Y., and Ying, K.C., 2007. A sequential exchange approach for minimising earliness-tardiness penalties of single machine scheduling with a common due date. European Journal of Operational Research, 177, 1294-1301.
21. Mazzini, R. and Armentano, V., 2001. A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research, 128, 129-146.
22. Mehta, P., 2004. Production planning and scheduling in multi-stage batch processing environment [online]. Dissertation (PhD). Indian Institute of Management Ahmedabad, India. Available from: http://home.iitk.ac.in/pmehta/ thesis.pdf [Accessed 1 March 2008].
23. Nawaz, M., Enscore, E., and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega, 11, 91-95.
24. Nearchou, A.C., 2008. A differential evolution approach for the common due date early/tardy job scheduling problem. Computers & Operations Research, 35, 1329-1343.
25. Pinedo, M., 2002. Scheduling: Theory, algorithms and systems. NJ: Prentice Hall.
26. Rajendran, C. and Ziegler, H., 1997. An efficient heuristic for scheduling in a flowshop to minimise total weighted flow time of jobs. European Journal of Operational Research, 103, 129-138.
27. Reeves, C.R., 1995. Modern heuristic techniques for combinatorial problems. Oxford: Blackwell Scientific Press.
28. Sidney, J.B., 1977. Optimal single machine scheduling with earliness and tardiness penalties. Operations Research, 25, 62-69.
29. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
30. Uzsoy, R. and Wang, C.S., 2000. Performance of decomposition procedures for job shop scheduling problems with bottleneck machines. International Journal of Production Research, 38 (6), 1271-1286.
31. Woo, H.S. and Yim, D.S., 1998. A heuristic algorithm for mean flow time objective in flowshop scheduling. Computers and Operations Research, 25, 175-182.
32. Yeung, W.K., Oguz, C., and Cheng, T.C.E., 2004. Two-stage flowshop earliness and tardiness machine scheduling involving a common due window. International Journal of Production Economics, 90, 421-434.