Job shop scheduling based on earliness and tardiness penalties with due dates and deadlines: An enhanced genetic algorithm

International Journal of Advanced Manufacturing Technology

Volumn 61, Issue 5-8, 2012, Pages 657-666

  Yang, Hong An ^a   Sun, Qi Feng ^a   Saygin, Can ^b   Sun, Shu Dong ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Deadline; Decoding; Earliness and tardiness; Genetic algorithm; Job shop scheduling

Indexed keywords

DEADLINE; DUE DATES; EARLINESS AND TARDINESS; EARLINESS AND TARDINESS PENALTIES; ENHANCED GENETIC ALGORITHMS; INITIAL POPULATION; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; NP-HARD; OBJECTIVE FUNCTIONS; POPULATION SIZES; SCHEDULING PROBLEM; WEIGHTED EARLINESS; WEIGHTED TARDINESS;

ALGORITHMS; DECODING; GENETIC ALGORITHMS; MACHINE SHOPS; POPULATION STATISTICS;

CHROMOSOMES;

EID: 84864571633     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-011-3746-z     Document Type: Article

References (40)

1. Askin RG, Standridge CR (1993) Modeling and analysis of manufacturing systems. Wiley, New York
2. Atan MO, Akturk MS (2008) Single CNC machine scheduling with controllable processing times and multiple due dates. Int J Prod Res 46(21):6087-6111
3. Bake KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38(1):22-36
4. Balas E, Lancia G, Serafini P, Vazacopoulos A (1998) Job shop scheduling with deadlines. J Comb Optim 1(4):329-353
5. Baptiste P, Croce FD, Grosso A, T'kindt V (2010) Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J Sched 13(1):39-47
6. Baptiste P, Flamini M, Sound F (2008) Lagrangian bounds for just-in-time job-shop scheduling. Comput Oper Res 35(3):906-915
7. Beck JC, Refalo P (2003) A hybrid approach to scheduling with earliness and tardiness costs. Ann Oper Res 118(1-4):49-71
8. Behnamian J, Fatemi Ghomi SMT, Zandieh M (2010) Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times. Int J Prod Res 48(5):1415-1438
9. Bulbul K, Kaminsky P, Yano C (2007) Preemption in single machine earliness/tardiness scheduling. J Sched 10(4-5):271-292
10. Chandra P, Mehta P, Tirupati D (2009) Permutation flow shop scheduling with earliness and tardiness penalties. Int J Prod Res 47(20):5591-5610
11. Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of jobshop scheduling problems using genetic algorithms-I. representation. Comput Ind Eng 30(4):983-997
12. Cheng R, Gen M, Tsujimura Y (1999) A tutorial survey of jobshop scheduling problems using genetic algorithms part II: hybrid genetic search strategies. Comput Ind Eng 36(2):343-364
13. Danna E, Perron L (2003) Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. The Ninth International Conference on Principles and Practice of Constraint Programming, Irlande: Kinsale, 817-821
14. Hariri AMA, Potts CN (1994) Single machine scheduling with deadlines to minimize the weighted number of tardy jobs. Manag Sci 40(12):1712-1719
15. Hepdogan S, Moraga R, DePuy GW, Whitehouse GE (2009) A Meta-RaPS for the early/tardy single machine scheduling problem. Int J Prod Res 47(7):1717-1732
16. Huang R, Yang C (2008) Ant colony system for job shop scheduling with time windows. Int J Adv Manuf Technol 39(1-2):151-157
17. Kedad-Sidhoum S, Sourd F (2010) Fast neighborhood search for the single machine earliness-tardiness scheduling problem. Comput Oper Res 37(8):1464-1471
18. Kelbel J, Hanzálek Z (2007) Constraint programming search procedure for earliness/tardiness job shop scheduling problem. Proceedings of the 26th Workshop of the UK Planning and Scheduling Special Interest Group, Czech Republic: Prague. pp 67-70.
19. Kellerer H, Strusevich VA (2010) Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack. Int J Found Comput Sci 21(3):357-383
20. Lauff V, Werner F (2004) Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey. Math Comput Model 40(5-6):637-655
21. Mansour MAA, Dessouky MM (2010) A hybrid genetic algorithm for solving the joint batching and scheduling of a batch processor with earliness and tardiness penalties. Int J Ind Syst Eng 5(2):143-158
22. Mason SJ, Jin S, Jampani J (2009) A moving block heuristic to minimise earliness and tardiness costs on parallel machines. Int J Prod Econ 47(19):5377-5390
23. Min L, Cheng W (2006) Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems. Robot Compute Int Manufac 22(4):279-287
24. Monette J, Deville Y, Hentenryck PV (2009) Just-in-time scheduling with constraint programming. ICAPS, Thessaloniki, pp 241-248
25. Moslehi G, Mirzaee M, Vasei M, Modarres M, Azaron A (2009) Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. Int J Prod Econ 122(2):763-773
26. Ribeiro FF, Souza MJF, Ricardo de Souza S (2011) An adaptive genetic algorithm to the single machine scheduling problem with earliness and tardiness penalties. Lecture Notes in Computer Science 6404:203-212
27. Safia KS, Yasmin RS, Francis S (2008) Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates. Eur J Oper Res 189(3):1305-1316
28. Santos A, Araujo R, Arroyo J (2010) A combination of evolutionary algorithm, mathematical programming, and a new local search procedure for the just-in-time job-shop scheduling problem. Lecture Notes in Computer Science 6073:10-24
29. Shabtay D (2008) Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput Oper Res 35(5):1539-1545
30. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278-285
31. Thiagarajan S, Rajendran C (2005) Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Comput Ind Eng 49(4):463-503
32. ToksarI MD, Güner E (2010) Parallel machine scheduling problem to minimize the earliness/tardiness costs with learning effect and deteriorating jobs. J Intell Manuf 21(6):843-885
33. Valencia LB, Rabadi G (2003) A multiagents approach for the job shop scheduling problem with earliness and tardiness. Proceedings of 2003 IEEE International Conference on Systems, Man and Cybernetics, 1-5, 1217-1222, Washington, D.C
34. Valente JMS, Goncalves JF (2009) A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput Oper Res 36(10):2707-2715
35. Valente JMS, Moreira MRA (2009) Greedy randomised dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties. Int J Adv Manuf Technol 44(9-10):995-1009
36. Watson J, Barbulescu L, Howe A, Whitley L (1999) Algorithms performance and problem structure for flow-shop scheduling. Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), 688-695
37. Ying KC (2008) Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm. Comput Ind Eng 55(2):494-502
38. Zhang C, Li P, Guan Z, Rao Y (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34(11):3229-3242
39. Zhang C, Li P, Rao Y, Li S (2005) A new hybrid GA/SA algorithm for the job shop scheduling problem. Lecture Notes in Computer Science 3448:246-259
40. Zobolas GI, Tarantilis CD, Ioannou G (2008) Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling. Int J Prod Res 46(12):3359-3386