IDEAS home Printed from https://ideas.repec.org/r/inm/oropre/v37y1989i5p798-804.html
   My bibliography  Save this item

On the Complexity of Scheduling with Batch Setup Times

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Kim, Kap Hwan & Lee, Keung Mo & Hwang, Hark, 2003. "Sequencing delivery and receiving operations for yard cranes in port container terminals," International Journal of Production Economics, Elsevier, vol. 84(3), pages 283-292, June.
  2. Crauwels, H. A. J. & Potts, C. N. & Van Wassenhove, L. N., 1996. "Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs," European Journal of Operational Research, Elsevier, vol. 90(2), pages 200-213, April.
  3. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
  4. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
  5. Jordan, Carsten, 1995. "A two-phase genetic algorithm to solve variants of the batch sequencing problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 363, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  6. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
  7. Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
  8. repec:dgr:rugsom:95a37 is not listed on IDEAS
  9. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
  10. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.
  11. Liji Shen & Lars Mönch & Udo Buscher, 2013. "An iterative approach for the serial batching problem with parallel machines and job families," Annals of Operations Research, Springer, vol. 206(1), pages 425-448, July.
  12. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
  13. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
  14. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
  15. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
  16. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.
  17. Jordan, Carsten & Drexl, Andreas, 1993. "A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 322, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  18. Yang, Wen-Hua & Chand, Suresh, 2008. "Learning and forgetting effects on a group scheduling problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1033-1044, June.
  19. Carsten Jordan & Andreas Drexl, 1998. "Discrete Lotsizing and Scheduling by Batch Sequencing," Management Science, INFORMS, vol. 44(5), pages 698-713, May.
  20. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
  21. F Jin & J N D Gupta & S Song & C Wu, 2010. "Single machine scheduling with sequence-dependent family setups to minimize maximum lateness," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1181-1189, July.
  22. Dominik Kress & Maksim Barketau & Erwin Pesch, 2018. "Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines," Journal of Scheduling, Springer, vol. 21(6), pages 595-606, December.
  23. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
  24. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
  25. Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
  26. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
  27. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
  28. Weng, Michael X. & Lu, John & Ren, Haiying, 2001. "Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective," International Journal of Production Economics, Elsevier, vol. 70(3), pages 215-226, April.
  29. Wang, Xiuli & Cheng, T.C.E., 2009. "Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers," International Journal of Production Economics, Elsevier, vol. 119(1), pages 199-206, May.
  30. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
  31. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
  32. Gregory H. Graves & Chung‐Yee Lee, 1999. "Scheduling maintenance and semiresumable jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 845-863, October.
  33. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
  34. Kenneth R. Baker, 1999. "Heuristic procedures for scheduling job families with setups and due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 978-991, December.
  35. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
  36. Mütze, Torsten, 2014. "Scheduling with few changes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 37-50.
  37. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
  38. Jens Heger & Jürgen Branke & Torsten Hildebrandt & Bernd Scholz-Reiter, 2016. "Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6812-6824, November.
  39. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
  40. Jordan, Carsten & Drexl, Andreas, 1994. "Lotsizing and scheduling by batch sequencing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 343, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.