A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems

Computers and Operations Research

Volumn 37, Issue 7, 2010, Pages 1298-1307

  Barlatt, Ada Y ^a   Cohn, Amy M ^b   Gusikhin, Oleg ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF MICHIGAN   (United States)

^c FORD MOTOR COMPANY   (United States)

Author keywords

Algorithms; Integer programming; Resource allocation; Scheduling

Indexed keywords

AUTOMOTIVE STAMPING; COMMON PROBLEMS; COMPUTATIONAL EXPERIMENT; COST BENEFITS; FEASIBILITY PROBLEM; OPERATIONAL CONSTRAINTS; OPTIMALITY; PROBLEM INSTANCES; PRODUCTION PLANNING IS; REAL-WORLD PROBLEM; SEARCH-BASED ALGORITHMS; SEQUENCING PROBLEMS; TASK SEQUENCING;

ALGORITHMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; COST REDUCTION; DYNAMIC PROGRAMMING; PLANNING; PRODUCTION CONTROL; RESOURCE ALLOCATION;

INTEGER PROGRAMMING;

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

References (19)

1. Bernstein D., Rodeh M., and Gertner I. On the complexity of scheduling problems for parallel/pipelined machines. IEEE Transactions on Computers 38 9 (1989) 1308-1313
2. Garey M., Johnson D., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129. http://www.jstor.org/stable/3689278 URL: 〈http://www.jstor.org/stable/3689278〉
3. Monma C., and Potts C. On the complexity of scheduling with batch setup times. Operations Research 37 5 (1989) 798-804
4. Potts C., and Kovalyov M. Scheduling with batching: a review. European Journal of Operational Research 120 2 (2000) 228-249
5. Blazewicz J., Lenstra J., and Rinnooy Kan A. Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5 1 (1983) 11-24. http://www.sciencedirect.com/science/article/B6TYW-46R0R6F-4/2/a67d403ffd23a6fe6276b7ee246a28ff URL: 〈http://www.sciencedirect.com/science/article/B6TYW-46R0R6F-4/2/a67d403ffd23a6fe6276b7ee246a28ff〉
6. Armacost A., Barnhart C., and Ware K. Composite variable formulations for express shipment service network design. Transportation Science 35 1 (2002) 1-29
7. Daskin M., and Melkote S. An integrated model of facility location and transportation network design. Transportation Research Part A: Policy and Practice 35 6 (2001) 515-538
8. Gabbay H. Multi-stage production planning. Management Science 25 11 (1979) 1138-1148
9. Burch E., and Qiu M. Hierarchical production planning and scheduling in a multi-product, multi-machine environment. International Journal of Production Research 35 11 (1997) 3023-3042
10. Barlatt A., Cohn A., Guisikin O., Fradkin Y., and Morford C. Using composite variable modeling to achieve realism and tractability in production planning: an example from automotive stamping. IIE Transactions 41 5 (2009) 421-436. http://ioe.engin.umich.edu/techrprt/pdf/TR07-01.pdf URL: 〈http://ioe.engin.umich.edu/techrprt/pdf/TR07-01.pdf〉
11. Gusikhin O, Rossi G. Improving automotive supplier operations through information logistics. The knowledge gap in enterprise information flow, 2004. p. 81-94.
12. Gusikhin O, Rossi G. Well-connected: Mes data integration in the automotive supply chain. APICS the performance advantage, 2005. p. 32-5.
13. Klose A. An lp-based heuristic for two-stage capacitated facility location problems. The Journal of the Operational Research Society 50 2 (1999) 157-166
14. Benders J.F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 1 (1962) 238-252
15. Geoffrion A.M. Generalized benders decomposition. Journal of Optimization Theory and Applications 10 4 (1972) 237-260
16. Binato S., Pereira M., and Granville S. A new benders decomposition approach to solve power transmission network design problems. IEEE Transactions on Power Systems 16 2 (2001) 235-240
17. Hooker J., and Ottosson G. Logic-based benders decomposition. Mathematical Programming 96 1 (2003) 33-60
18. Rasmussen R.S., and Trick M. A benders approach for the constrained minimum break problem. European Journal of Operational Research 177 1 (2007) 198-213
19. Cohn A., and Barnhart C. Improving crew scheduling by incorporating key maintenance routing decisions. Operations Research 51 3 (2003) 387-396