Production lot sizing and scheduling with non-triangular sequence-dependent setup times

International Journal of Production Research

Volumn 52, Issue 8, 2014, Pages 2490-2503

  Clark, Alistair ^a   Mahdieh, Masoumeh ^b   Rangel, Socorro ^c  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

^b MIDDLESEX UNIVERSITY BUSINESS SCHOOL   (United Kingdom)

^c SÃO PAULO STATE UNIVERSITY UNESP   (Brazil)

Author keywords

Lot sizing and scheduling; Non triangular setup times; Sequence dependent setup times

Indexed keywords

DECONTAMINATION; OPTIMIZATION;

COMPUTATIONAL TESTS; EXPONENTIAL NUMBERS; LOT-SIZING AND SCHEDULING; OPTIMAL MODEL; POLYNOMIAL NUMBER; PRODUCTION LOT SIZINGS; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME;

SCHEDULING;

EID: 84896399198     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2014.885662     Document Type: Article

References (30)

1. Araújo, S. A., M. N. Arenales, and A. R. Clark. 2007. "Joint Rolling-horizon Scheduling of Materials Processing and Lot-sizing with Sequence-dependent Setups." Journal of Heuristics 13 (4): 337-358
2. Carpaneto, G., M. Dell'Amico, and P. Toth. 1995. "Exact Solution of Large Scale Asymmetric Travelling Salesman Problems." ACM Transactions on Mathematical Software 21 (4): 394-409
3. Chan, H.K., S. H. Chung, andM.K. Lim. 2013. "Recent ResearchTrend of Economic-lot Scheduling Problems." Journal of Manufacturing Technology Management 24 (3): 465-482
4. Clark, A. R. 2003. "Optimization Approximations for Capacity Constrained Material Requirements Planning." International Journal of Production Economics 84 (2): 115-131
5. Clark, A. R., B. Almada-Lobo, and C. Almeder. 2011. "Editorial: Lot Sizing and Scheduling-Industrial Extensions and Research Opportunities, Special Issue on Lot Sizing and Scheduling." International Journal of Production Research 49 (9): 2457-2461
6. Clark, A. R., and S. J. Clark. 2000. "Rolling-horizon Lot-sizing When Setup Times are Sequence-dependent." International Journal of Production Research 38 (10): 2287-2308
7. Clark, A. R., R. Morabito, and E. A. V. Toso. 2010. "Production Setup-sequencing and Lot-sizing at an Animal Nutrition Plant through ATSP Subtour Elimination and Patching." Journal of Scheduling 13 (2): 111-121
8. Claus, A. 1984. "A New Formulation for the Travelling Salesman Problem." SIAM Journal on Algebraic and Discrete Methods 5: 21-5
9. Corder, G. W., and D. I. Foreman. 2009. Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach. Hoboken, NJ: Wiley-Blackwell
10. Dantzig, G., R. Fulkerson, and S. Johnson. 1954. "Solution of a Large-scaleTraveling-salesman Problem." Operations Research 2: 393-410
11. Drexl, A., and A. Kimms. 1997. "Lot Sizing and Scheduling-Survey and Extensions." European Journal of Operational Research 99: 221-235
12. Ferreira, D., A. R. Clark, B. Almada-Lobo, and R. Morabito. 2012. "Single-stage Formulations for Synchronised Two-stage Lot Sizing and Scheduling in Soft-drink Production." International Journal of Production Economics 136 (2): 255-265
13. Ferreira, D., R. Morabito, and S. Rangel. 2009. "SolutionApproaches for the Soft Drink Integrated Production Lot Sizing and Scheduling Problem." European Journal of Operational Research 196: 697-706
14. Fischetti, M., and A. Lodi. 2003. "Local Branching." Mathematical Programming, Series B 98: 23-47
15. Fleischmann, B., and H. Meyr. 1997. "The General Lotsizing and Scheduling Problem." OR Spektrum 19 (1): 11-21
16. Fourer, R., D. M. Gay, and B.W. Kernighan.2003. AMPL-A Modeling Language forMathematical Programming. Second USA: Duxbury Press / Brooks-Cole Publishing Company. Accessed November 28, 2013. www.ampl.com
17. Guimarães, L., D. Klabjan, and B.Almada-Lobo. 2013. "Pricing, Relaxing and Fixing under Lot Sizing and Scheduling." European Journal of Operational Research 230 (2): 399-411
18. Gurobi Optimization Inc. 2011. Gurobi Optimizer Version 4.5.0. Accessed November 28, 2013. www.gurobi.com
19. Haase, K., and A. Kimms. 1999. "Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling Opportunities." International Journal of Production Economics 66: 159-169
20. Karimi, B., S.M. T. Fatemi Ghomia, and J.M.Wilson. 2003. "The Capacitated Lot Sizing Problem:AReview of Models andAlgorithms." Omega 31: 365-378
21. Karp, R. M. 1979. "A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem." SIAM Journal on Computing 8 (4): 561-573
22. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys. 1985. The Traveling Salesman Problem-A Guided Tour of Combinatorial Optimization. Chichester:Wiley
23. Menezes, A., A. Clark, and B.Almada-Lobo. 2011. "Capacitated Lot-sizing and Scheduling with Sequence-dependent, Period-overlapping and Non-Triangular Setups." Journal of Scheduling 14 (2): 209-219
24. Meyr, H. 2000. "Simultaneous Lot-sizing and Scheduling by Combining Local Search with Dual Optimization." European Journal of Operational Research 120: 311-326
25. Meyr, H. 2002. "Simultaneous Lotsizing and Scheduling on ParallelMachines." European Journal of Operational Research 139: 277-292
26. Öncan, T., K. Altinel, and G. Laporte. 2009. "A ComparativeAnalysis of Several Asymmetric Traveling Salesman Problem Formulations." Computers and Operations Research 36 (3): 637-654
27. Punnen, A. P. 2002. "The Travelling Salesman Problem-Application, Formulations and Variations." In The Traveling Salesman Problem and its Variations, edited by G. Gutin and A. P. Punnen, 1-28. Dordrecht: Kluwer
28. Suerie, C. 2006. "Modeling of period overlapping setup times." European Journal of Operational Research, 174 (2), 874-886
29. Toso, E. A. V., R. Morabito, and A. R. Clark. 2009. "Lot-sizing and Sequencing Optimisation at an Animal-feed Plant." Computers and Industrial Engineering 57: 813-821
30. Zhang, W. 2000. "Depth-first Branch-And-bound versus Local Search: A Case Study." AAAI/IAAI Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), July August, 930-935. Austin, TX. http://citeseer.ist.psu.edu/470650.html.