A constraint programming approach for a batch processing problem with non-identical job sizes
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2012.04.008
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
- Michael Trick, 2003. "A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints," Annals of Operations Research, Springer, vol. 118(1), pages 73-84, February.
- Jolai Ghazvini, Fariborz & Dupont, Lionel, 1998. "Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes," International Journal of Production Economics, Elsevier, vol. 55(3), pages 273-280, August.
- 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.
- E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
- 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.
- Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
- Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
- Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ozturk, Onur, 2020. "A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 432-443.
- Xu, Jun & Wang, Jun-Qiang & Liu, Zhixin, 2022. "Parallel batch scheduling: Impact of increasing machine capacity," Omega, Elsevier, vol. 108(C).
- Ozturk, Onur & Begen, Mehmet A. & Zaric, Gregory S., 2014. "A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services," European Journal of Operational Research, Elsevier, vol. 239(1), pages 214-226.
- 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.
- 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).
- 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.
- M. Vimala Rani & M. Mathirajan, 2020. "Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 462-512, June.
- Wang, Kai & Pesch, Erwin & Kress, Dominik & Fridman, Ilia & Boysen, Nils, 2022. "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse," European Journal of Operational Research, Elsevier, vol. 296(2), pages 504-519.
- Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
- Nascimento, Paulo Jorge & Silva, Cristóvão & Antunes, Carlos Henggeler & Moniz, Samuel, 2024. "Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 317(1), pages 92-110.
- Min Kong & Xinbao Liu & Jun Pei & Panos M. Pardalos & Nenad Mladenovic, 2020. "Parallel-batching scheduling with nonlinear processing times on a single and unrelated parallel machines," Journal of Global Optimization, Springer, vol. 78(4), pages 693-715, December.
- 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.
- A. Alfieri & A. Druetto & A. Grosso & F. Salassa, 2021. "Column generation for minimizing total completion time in a parallel-batching environment," Journal of Scheduling, Springer, vol. 24(6), pages 569-588, December.
- Aurélien Froger & Michel Gendreau & Jorge E. Mendoza & Eric Pinson & Louis-Martin Rousseau, 2018. "Solving a wind turbine maintenance scheduling problem," Journal of Scheduling, Springer, vol. 21(1), pages 53-76, February.
- Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
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.
- 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.
- 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.
- 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.
- Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes," European Journal of Operational Research, Elsevier, vol. 240(3), pages 649-665.
- Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
- 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.
- Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
- Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
- Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
- Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
- 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.
- Matin, Hossein N.Z. & Salmasi, Nasser & Shahvari, Omid, 2017. "Makespan minimization in flowshop batch processing problem with different batch compositions on machines," International Journal of Production Economics, Elsevier, vol. 193(C), pages 832-844.
- Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
- 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.
- 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.
- Grundel, S. & Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M., 2012. "Family Sequencing and Cooperation," Other publications TiSEM 830f760f-f003-40df-a01c-6, Tilburg University, School of Economics and Management.
- Grundel, S. & Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M., 2012. "Family Sequencing and Cooperation," Discussion Paper 2012-040, Tilburg University, Center for Economic Research.
- 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.
- Muter, İbrahim, 2020. "Exact algorithms to minimize makespan on single and parallel batch processing machines," European Journal of Operational Research, Elsevier, vol. 285(2), pages 470-483.
- 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.
- Bredstrom, David & Lundgren, Jan T. & Ronnqvist, Mikael & Carlsson, Dick & Mason, Andrew, 2004. "Supply chain optimization in the pulp mill industry--IP models, column generation and novel constraint branches," European Journal of Operational Research, Elsevier, vol. 156(1), pages 2-22, July.
More about this item
Keywords
Combinatorial optimization; Artificial intelligence; Constraint programming; Scheduling; Packing;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:eee:ejores:v:221:y:2012:i:3:p:533-545. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.