Robust scheduling on a single machine to minimize total flow time

Computers and Operations Research

Volumn 39, Issue 7, 2012, Pages 1682-1691

  Lu, Chung Cheng ^a   Lin, Shih Wei ^b   Ying, Kuo Ching ^a  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b CHANG GUNG UNIVERSITY   (Taiwan)

Author keywords

Robust scheduling; Sequence dependent family setup times; Single machine scheduling; Total flow time

Indexed keywords

ABSOLUTE DEVIATIONS; ALGORITHMIC FRAMEWORK; BEST WORST-CASE PERFORMANCE; CONSTRAINED SHORTEST PATH; DEGREE OF UNCERTAINTY; FAMILY SET-UP TIME; INTERVAL DATA; JOB PROCESSING TIME; LABEL CORRECTING; MANUFACTURING ENVIRONMENTS; NP-HARD; NUMERICAL EXPERIMENTS; OPTIMAL SCHEDULE; OPTIMAL SOLUTIONS; OPTIMALITY; PERFORMANCE MEASURE; PRODUCTION SCHEDULE; ROBUST SCHEDULING; SCHEDULE ROBUSTNESS; SEQUENCE-DEPENDENT; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING; STOCHASTIC SCHEDULING; TOTAL FLOWTIME; WORST CASE SCENARIO;

DATA PROCESSING; MACHINERY; MANUFACTURE; REAL TIME SYSTEMS; SIMULATED ANNEALING; STOCHASTIC MODELS;

SCHEDULING;

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

References (42)

1. I Sabuncuoglu, and S. Goren Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research International Journal of Computer Integrated Manufacturing 22 2009 138 157
2. A. Allahverdi, CT Ng, TCE Cheng, and MY. Kovalyov A survey of scheduling problems with setup times or costs European Journal of Operational Research 187 2008 985 1032 (Pubitemid 350236619)
3. BH Ahn, and JH. Hyun Single facility multi-class job scheduling Computer & Operations Research 17 1990 265 272
4. CN Potts, and LN. Van Wassenhove Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity Journal of Operational Research Society 43 1992 395 406
5. EJ Schaller, JND Gupta, and AJ. Vakharia Scheduling a flowline manufacturing cell with sequence dependent family setup times European Journal of Operational Research 125 2000 324 339
6. S Webster, and KR. Baker Scheduling groups of jobs on a single machine Operations Research 43 1995 692 703
7. JND. Gupta Single facility scheduling with multiple job classes European Journal of Operational Research 8 1988 42 45
8. CL Monma, and CN. Potts On the complexity of scheduling with batch setup times Operations Research 37 1989 798 804
9. AJ Mason, and EJ. Anderson Minimizing flow time on a single machine with job classes and setup times Naval Research Logistics 38 1991 333 350
10. JB. Ghosh Batch scheduling to minimize total completion time Operations Research Letters 16 1994 271 275
11. S Karabati, and C. Akkan Minimizing sum of completion times on a single machine with sequence-dependent family setup times Journal of the Operational Research Society 57 2006 271 280
12. AK Agrawala, EG Coffman Jr., MR Garey, and SK. Tripathi A static optimization algorithm minimizing expected flow time on uniform processors IEEE Transactions on Computing 33 1984 351 357
13. HM. Soroush Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem European Journal of Operational Research 181 2007 266 287
14. X Wu, and X. Zhou Stochastic scheduling to minimize expected maximum lateness European Journal of Operational Research 190 2008 103 115 (Pubitemid 351434638)
15. D Trietsch, and KR. Baker Minimizing the number of tardy jobs with stochastically-ordered processing times Journal of Scheduling 11 2008 71 73
16. M van den Akker, and H. Hoogeveen Minimizing the number of late jobs in a stochastic setting using a chance constraint Journal of Scheduling 11 2008 56 69
17. JM Mulvey, and RJ. Vanderbei Robust optimization of large-scale systems Operations Research 43 1995 264 281
18. P Kouvelis, and G. Yu Robust discrete optimization and its applications 1997 Kluwer Academic Publishers Boston
19. RL Daniels, and P. Kouvelis Robust scheduling to hedge against processing time uncertainty in single-stage production Management Science 41 1995 363 376
20. J Yang, and G. Yu On the robust single machine scheduling problem Journal of Combinatorial Optimization 6 2002 17 33 (Pubitemid 34130061)
21. A. Kasperski Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion Operations Research Letters 33 2005 431 436 (Pubitemid 40339644)
22. RL Graham, EL Lawler, JK Lenstra, and AHG Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
23. JB Mazzola, and AW. Neebe Resource-constrained assignment scheduling Operations Research 34 1986 560 572
24. Karasan OE, Pinar MC, Yaman H. The robust shortest path problem with interval data. 〈http://www.optimization-online.org/DB-HTML/2001/08/361. html〉; 2003.
25. A Lim, B Rodrigues, and X. Zhang A simulated annealing and hill-climbing algorithm for the traveling tournament problem European Journal of Operational Research 174 2006 1459 1478 (Pubitemid 44202646)
26. AR McKendall Jr., J Shan, and S. Kuppusamy Simulated annealing heuristics for the dynamic facility layout problem Computers and Operations Research 33 2006 2431 2444 (Pubitemid 41802297)
27. SW Lin, SY Chou, and SC. Chen Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date Journal of Heuristics 13 2007 151 165
28. KH Kim, and KC. Moon Berth scheduling by simulated annealing Transportation Research Part B 37 2003 542 560
29. TJ Candalino Jr., JE Kobza, and SH. Jacobson Designing optimal aviation baggage screening strategies using simulated annealing Computers and Operations Research 31 2004 1753 1767 (Pubitemid 38473907)
30. DH Lee, Z Cao, and Q. Meng Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm International Journal of Production Economics 107 2007 115 124
31. B Suman, and P. Kumar A survey of simulated annealing as a tool for single and multiobjective optimization Journal of the Operational Research Society 57 2006 1143 1160 (Pubitemid 44386382)
32. MR Garey, and DS. Johnson Computers and Intractability: A guide to the theory of NP-completeness 1979 Freeman San Francisco
33. M Desrochers, and F. Soumis A generalized permanent labeling algorithm for the shortest path problem with time windows INFOR 26 1988 191 212
34. I Dumitrescu, and N. Boland Improved preprocessing, labeling and scaling algorithm for the weight-constrained shortest path problem Networks 42 2003 135 153
35. G Handler, and I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
36. J Beasley, and N. Christofides An algorithm for the resource constrained shortest path problem Networks 19 1989 379 394
37. WM Carlyle, JO Royset, and RK. Wood Lagrangian relaxation and enumeration for solving constrained shortest-path problems Networks 52 2008 256 270
38. WM Carlyle, and RK. Wood Near shortest and K-shortest simple paths Networks 46 2003 98 109
39. AK Ziliaskopoulos, and HS. Mahmassani Time-dependent shortest path algorithm for real-time intelligent vehicle highway system applications Transportation Research Record 1408 1993 94 100
40. AK Ziliaskopoulos, and HS. Mahmassani A note on least time path computation considering delays and prohibitions for intersection movements Transportation Research Part B 30 1996 359 367
41. P. Hansen Bicriterion Path Problems G. Fandel, T. Gal, Multiple Criteria Decision Making: Theory and Applications 1980 Springer Heidelberg 109 127
42. MI. Henig The shortest path problem with two objectives European Journal of Operational Research 25 1985 281 291