Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1227-1249

  Ruiz Torres, Alex J ^a   Centeno, Grisselle ^b  

^a UNIVERSITY OF TEXAS AT EL PASO   (United States)

^b University of South Florida   (United States)

Author keywords

Dual resource scheduling; Flowshop; Number of tardy jobs; Scheduling; Secondary resources; Simulated annealing

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEALTH CARE; HEURISTIC METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION; SIMULATED ANNEALING;

DUAL RESOURCE SCHEDULING; SECONDARY RESOURCES;

SCHEDULING;

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

References (35)

1. Briand C., Trung La H., and Erschler J. A new sufficient condition of optimality for the two-machine flowshop problem. European Journal of Operational Research 169 3 (2006) 712-722
2. Fondrevelle J., Oulamara A., and Portmann M. Permutation flowshop scheduling problems with maximal and minimal time lags. Computers & Operations Research 33 6 (2006) 1540-1556
3. Ruiz R., and Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research 165 2 (2005) 479-494
4. Lian Z., Gu X., and Jiao B. A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Applied Mathematics and Computation 175 1 (2006) 773-785
5. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 5 (2006) 461-476
6. França P.M., Gupta J.N.D., Mendes A.S., Moscato P., and Veltink K.J. Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers & Industrial Engineering 48 3 (2005) 491-506
7. Framinan J.M., and Leisten R. A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness. International Journal of Production Economics 99 1-2 (2006) 28-40
8. Varadharajan T.K., and Rajendran C.A. multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. European Journal of Operational Research 167 3 (2005) 772-795
9. El-Bouri A., Balakrishnan S., and Popplewell N. A neural network to enhance local search in the permutation flowshop. Computers & Industrial Engineering 49 1 (2005) 182-196
10. Rajendran C., and Ziegler H. Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Computers & Industrial Engineering 48 4 (2005) 789-797
11. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 32 5 (2005) 1237-1254
12. Chung C.-S., Flynn J., and Kirca O. A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems. European Journal of Operational Research 174 1 (2006) 1-10
13. Lodree E., Jang W., and Klein C.M. A new rule for minimizing the number of tardy jobs in dynamic flow shops. European Journal of Operational Research 159 (2004) 258-263
14. Sung C.S., and Kim Y.H. Minimizing due date related performance measures on two batch processing machines. European Journal of Operational Research 147 (2003) 644-656
15. Della Croce F., Gupta J.N.D., and Tadei R. Minimizing tardy jobs in a flowshop with common due date. European Journal of Operational Research 120 (2000) 375-381
16. Lin B. Scheduling in the two-machine flowshop with due date constraints. International Journal of Production Economics 70 (2001) 117-123
17. Gupta J.N.D., and Stafford E.F. Flowshop scheduling research after five decades. European Journal of Operational Research 169 3 (2006) 699-711
18. Moore J.M. An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science 15 (1968) 102-109
19. Hariri A.M.A., and Potts C.N. A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop. European Journal of Operational Research 38 (1989) 228-237
20. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
21. Hoogeveen H. Multicriteria scheduling. European Journal of Operational Research 167 3 (2005) 592-623
22. Ng C.T.D., Cheng T.C.E., Kovalyov M.Y., and Lam S.S. Single machine scheduling with a variable common due date and resource-dependent processing times. Computers & Operations Research 30 8 (2003) 1173-1185
23. Cheng TCE, Kovalyov MY, Shakhlevich nV. Scheduling with controllable release dates and processing times: makespan minimization. European Journal of Operational Research, in press.
24. Kaspi M., and Shabtay D. A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers & Operations Research 33 10 (2006) 3015-3033
25. Gupta J.N.D., Krüger K., Lauff V., Werner F., and Sotskov Y.N. Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Computers & Operations Research 29 10 (2002) 1417-1439
26. Cheng T.C.E., Chen Z.L., and Chung-Lun L. Parallel machine scheduling with controllable processing times. IIE Transactions 28 (1996) 177-180
27. Kher H. Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments. Computers and Operations Research 27 6 (2000) 525-537
28. Daniels R.L., Hoopes B.J., and Mazzola J.B. Scheduling parallel manufacturing cells with resource flexibility. Management Science 42 (1996) 1260-1276
29. Daniels R.L., Hua S.Y., and Webster S. Heuristics for parallel machine flexible resource scheduling problems with unspecified job assignment. Computers & Operations Research 26 (1999) 143-155
30. Jensen J.B. The impact of resource flexibility and staffing decisions on cellular and departmental performance. European Journal of Operational Research 127 (2000) 279-296
31. Olafsson S., and Shi L. A method for scheduling in parallel manufacturing systems with flexible resources. IIE Transactions 32 (2000) 135-146
32. Ruiz-Torres A.J., and Centeno G. Scheduling with flexible resources in parallel workcenters to minimize maximum completion time. Computers & Operations Research 34 1 (2007) 48-69
33. Kim Y.D. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 (1995) 541-555
34. Low C. Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research 32 8 (2005) 2013-2025
35. Ruiz-Torres A.J., and Lopez F. Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling. Computers and Industrial Engineering 47 2-3 (2004) 107-121