Iterated local search for single machine total weighted tardiness batch scheduling
Author
Abstract
Suggested Citation
DOI: 10.1007/s10732-020-09461-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Chung-Yee Lee & Reha Uzsoy & Louis A. Martin-Vega, 1992. "Efficient Algorithms for Scheduling Semiconductor Burn-In Operations," Operations Research, INFORMS, vol. 40(4), pages 764-775, August.
- Jacek Blazewicz & Klaus H. Ecker & Erwin Pesch & Günter Schmidt & Malgorzata Sterna & Jan Weglarz, 2019. "Handbook on Scheduling," International Handbooks on Information Systems, Springer, edition 2, number 978-3-319-99849-7, September.
- 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.
- C Almeder & L Mönch, 2011. "Metaheuristics for scheduling jobs with incompatible families on parallel batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2083-2096, December.
- Helena Ramalhinho Lourenço & Olivier C. Martin & Thomas Stützle, 2019. "Iterated Local Search: Framework and Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 129-168, Springer.
- C Almeder & L Mönch, 2011. "Metaheuristics for scheduling jobs with incompatible families on parallel batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2083-2096, December.
- Vishnu Erramilli & Scott Mason, 2008. "Multiple orders per job batch scheduling with incompatible jobs," Annals of Operations Research, Springer, vol. 159(1), pages 245-260, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
- Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
- Zhang, Han & Li, Kai & Jia, Zhao-hong & Chu, Chengbin, 2023. "Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1024-1046.
- Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
- Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
- Bin Ji & Xin Xiao & Samson S. Yu & Guohua Wu, 2023. "A Hybrid Large Neighborhood Search Method for Minimizing Makespan on Unrelated Parallel Batch Processing Machines with Incompatible Job Families," Sustainability, MDPI, vol. 15(5), pages 1-25, February.
- Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
- Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
- Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian, 2022. "Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1512-1530, May.
- Jia, Zhao-hong & Li, Kai & Leung, Joseph Y.-T., 2015. "Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities," International Journal of Production Economics, Elsevier, vol. 169(C), pages 1-10.
- Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
- Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
- Yuan Gao & Jinjiang Yuan, 2019. "Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 698-711, October.
- Kovalyov, M. Y. & Potts, C. N. & Strusevich, V. A., 2004. "Batching decisions for assembly production systems," European Journal of Operational Research, Elsevier, vol. 157(3), pages 620-642, September.
- Nodari Vakhania & Badri Mamporia, 2020. "Fast Algorithms for Basic Supply Chain Scheduling Problems," Mathematics, MDPI, vol. 8(11), pages 1-19, November.
- Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
- Zhang, Hongbin & Yang, Yu & Wu, Feng, 2024. "Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine," Omega, Elsevier, vol. 122(C).
- Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
- Lin, B.M.T. & Cheng, T.C.E. & Chou, A.S.C., 2007. "Scheduling in an assembly-type production chain with batch transfer," Omega, Elsevier, vol. 35(2), pages 143-151, April.
- Li, Kai & Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "Integrated production and delivery on parallel batching machines," European Journal of Operational Research, Elsevier, vol. 247(3), pages 755-763.
- Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
- Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
- Li, Wenhua & Yuan, Jinjiang, 2006. "Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost," International Journal of Production Economics, Elsevier, vol. 102(1), pages 143-148, July.
More about this item
Keywords
Batch scheduling; Total weighted tardiness; Iterated local search; Metaheuristics;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:27:y:2021:i:3:d:10.1007_s10732-020-09461-x. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.