Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: A mixed nonlinear integer programming approach

International Journal of Advanced Manufacturing Technology

Volumn 38, Issue 7-8, 2008, Pages 801-808

  ToksarI, M Duran ^a   Güner, Ertan ^b  

^a ERCIYES UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

Common due date; Deterioration jobs; Earliness tardiness; Learning effect; Parallel machine; Scheduling; Sequence dependent setup time

Indexed keywords

DETERIORATION; DYNAMIC PROGRAMMING; EDUCATION; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; PARALLEL PROGRAMMING;

COMMON DUE DATE; DETERIORATING JOBS; DETERIORATION JOBS; DEVELOPED MODEL; DUE DATES; EARLINESS/TARDINESS; EARLY/TARDY; LEARNING EFFECT; LEARNING EFFECTS; LINEAR DETERIORATION; NON-LINEAR INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; PARALLEL MACHINE; PARALLEL MACHINES; PROCESSING TIME; SCHEDULING; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SEQUENCE-DEPENDENT SETUPS; TWO MACHINES;

INTEGER PROGRAMMING;

EID: 49649118743     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1128-3     Document Type: Article

References (47)

1. Hino CM, Ronconi DP, Mendes AB (2005) Minimizing earliness and tardiness penalties in a single-machine problem with a common due date. Eur J Oper Res 160:190-201
2. Baker KR (1994) Elements of sequencing and scheduling. HN, Hanover
3. Baker KR, Scudder GD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38(1):22-36
4. Bank J, Werner F (2001) Heuristics algorithms for unrelated parallel machine scheduling with a common due date, release dates and linear earliness tardiness penalties. Math Comput Model 33:363-383
5. Zhu Z, Heady RB (2000) Minimizing the sum of earliness/tardiness in multi-machine scheduling: a mixed integer programming approach. Comput Ind Eng 38:297-305
6. Sun H, Wang G (2003) Parallel machine earliness and tardiness scheduling with proportional weights. Comput Oper Res 30:801-808
7. Arkin EM, Roundy RO (1991) Weighted-tardiness scheduling on parallel machines with proportional weights. Oper Res 39(1):64-81
8. Xiao W-Q, Li C-L (2002) Approximation algorithms for common due date assignment and job scheduling on parallel machines. IIE Transactions 34:467-477
9. Radhakrishnan S, Ventura JA (2000) Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. Int J Prod Res 38(10):2233-2252
10. Yi Y, Wang DW (2003) Soft computing for scheduling with batch setup times and earliness-tardiness penalties on parallel machines. J Intell Manuf 14:311-322
11. Chang P-C, Chen S-H, Lin K-L (2005) Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Syst Appl 29:705-712
12. Caoa D, Chena M, Wanb G (2005) Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comput Oper Res 32:1995-2012
13. Anghinolfi D, Paolucci M (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Comput Oper Res DOI 10.1016/j.cor.2006.02.009
14. Sourd F (2005) Earliness/tardiness scheduling with setup considerations. Comput Oper Res 32:1849-1865
15. Lopes MJP, de Carvalho JMV (2007) A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. Eur J Oper Res 176(3):1508-1527
16. Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132:687-693
17. Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173-178
18. Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665-670
19. Eren T, Güner E (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31(7):1351-1361
20. Koulamas C, Kyparisis GJ (2007) Single machine and two machine flowshop scheduling with general learning functions. Eur J Oper Res 178(2):402-407
21. Kuo WH, Yang DL (2006) Minimizing the total completion time in a single machine scheduling problem with a time dependent learning effect. Eur J Oper Res 174(2):1184-1190
22. Kuo WH, Yang DL (2006) Single machine group scheduling with a time dependent learning effect. Eur J Oper Res 33:2099-2112
23. Chen P, Wu C-C, Lee W-C (2006) A bi-criteria two-machine flowshop scheduling problem with a learning effect. J Oper Res Soc 57(9):1113-1125
24. Mosheiov G (1996) -shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184-1191
25. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387-393
26. Kunnatur AS, Gupta SK (1990) Minimizing the makespan with late starts penalties added the processing times in a single facility scheduling problem. Eur J Oper Res 47:56-64
27. Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495-498
28. Alidaee B, Womer NK (1999) Scheduling with time dependent processing times: review and extensions. J Oper Res Soc 50(7):711-720
29. Mosheiov G (1994) Scheduling jobs under simple linear deterioration. Comput Oper 21(6):653-659
30. Mosheiov G (1991) V-shaped policies for scheduling deteriorating jobs. Oper Res 39:979-991
31. Hsu YS, Lin BMT (2003) Minimization of maximum lateness under linear deterioration. Omega 31:459-469
32. Wang JB, Xia ZQ (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327-336
33. Wang JB, Ng CTD, Cheng TCE, Liu LL (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180(1):185-193
34. Wang X, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan. Eur J Oper Res 178(1):57-70
35. Wang JB (2007) Single-machine scheduling problems with the effects of learning and deterioration. Omega 35(4):397-402
36. Wang JB (2007) Flow shop scheduling problems with decreasing linear deterioration under dominant machines. Comput Oper Res 34(7):2043-2058
37. Wu CC, Lee WC (2006) Two-machine flowshop scheduling to minimize mean flow time under linear deterioration. Int J Prod Econ 103(2):572-584
38. Kang L, Ng CT (2006) A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int J Prod Econ DOI 10.1016/j.ijpe.2006.11.014
39. Cheng TCE, Kang L, Ng CT (2004) Due-date assignment and single machine scheduling with deteriorating jobs. J Oper Res Soc 55(2):198-203
40. Sundararaghavan PS, Kunnathur AS (1994) Single machine scheduling with start time dependent processing time: some solvable cases. Eur J Oper Res 78(3):394-403
41. Mosheiov G (1995) Scheduling jobs with step-deterioration: minimizing makespan on a single and multi-machine. Comput Ind Eng 28(4):869-879
42. Cheng TCE, Ding Q, Kovalyov MY, Bachman A, Janiak A (2003) Scheduling jobs with piecewise linear decreasing processing times. Nav Res Log 50(6):531-554
43. Kunnatur AS, Gupta SK (1990) Minimizing the makespan with late starts penalties added the processing times in a single facility scheduling problem. Eur J Oper Res 47:56-64
44. Kubiak W, Van de Velde S (1998) Scheduling deteriorating jobs to minimize makespan. Nav Res Log 45:511-523
45. Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Eng 14:387-393
46. Voutsinas GT, Pappis CP (2002) Scheduling jobs with values exponentially deteriorating over time. Int J Prod Econ 79:163-169
47. Cheng TCE, Ding Q, Lin BMT (2003) A concise survey on the scheduling problems with deteriorating processing times. Eur J Oper Res 152:1-13