Daniel Sascha Schorn & Lars Monch. (2022) Learning Dispatching Rules for Energy-Aware Scheduling of Jobs on a Single Batch Processing Machine. Learning Dispatching Rules for Energy-Aware Scheduling of Jobs on a Single Batch Processing Machine.
Artur Alves Pessoa, Teobaldo Bulhões, Vitor NeselloAnand Subramanian. (2022) Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling. INFORMS Journal on Computing 34:3, pages 1512-1530.
Crossref
Lili Liu. (2022) Batch scheduling with common due date to minimizing the total (weighted) tardiness. Batch scheduling with common due date to minimizing the total (weighted) tardiness.
John W. Fowler & Lars Mönch. (2022) A survey of scheduling with parallel batch (p-batch) processing. European Journal of Operational Research 298:1, pages 1-24.
Crossref
M. Vimala Rani & M. Mathirajan. (2021) Real Time Scheduling of Nonidentical Multiple Batch Processors with Machine Eligibility Restriction. International Journal of Mathematical, Engineering and Management Sciences 6:6, pages 1460-1486.
Crossref
Lili Liu. (2021) Batch scheduling with incompatible job families and common due date. Journal of Physics: Conference Series 2010:1, pages 012023.
Crossref
Haibo Wang, Shigang Chen, Md Sami Ul Islam Sami, Fahim Rahman & Mark Tehranipoor. 2021. Emerging Topics in Hardware Security. Emerging Topics in Hardware Security
27
59
.
Alexander Biele & Lars Mönch. (2019) Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines. Computers & Operations Research 103, pages 134-147.
Crossref
Marzieh Khakifirooz, Mahdi Fathi & Kan Wu. (2019) Development of Smart Semiconductor Manufacturing: Operations Research and Data Science Perspectives. IEEE Access 7, pages 108419-108430.
Crossref
Sreenath Chalil Madathil, Siddhartha Nambiar, Scott J. Mason & Mary E. Kurz. (2018) On scheduling a photolithography area containing cluster tools. Computers & Industrial Engineering 121, pages 177-188.
Crossref
Lars Mönch & Sebastian Roob. (2018) A matheuristic framework for batch machine scheduling problems with incompatible job families and regular sum objective. Applied Soft Computing 68, pages 835-846.
Crossref
Rene Ramacher & Lars Mönch. (2016) An automated negotiation approach to solve single machine scheduling problems with interfering job sets. Computers & Industrial Engineering 99, pages 318-329.
Crossref
Oliver G. Czibula, Hanyu Gu, Feng-Jang Hwang, Mikhail Y. Kovalyov & Yakov Zinder. (2016) Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom. Computers & Operations Research 65, pages 53-63.
Crossref
Zhao-hong Jia, Chao Wang & Joseph Y.-T. Leung. (2016) An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families. Applied Soft Computing 38, pages 395-404.
Crossref
M. Vimala Rani & M. Mathirajan. (2015) Dynamic scheduling of Diffusion Furnace in Semiconductor Manufacturing with real time events. Dynamic scheduling of Diffusion Furnace in Semiconductor Manufacturing with real time events.
Abdullah Çerekçi & Amarnath Banerjee. (2015) Effect of upstream re-sequencing in controlling cycle time performance of batch processors. Computers & Industrial Engineering 88, pages 206-216.
Crossref
Muhammad Al-Salamah. (2015) Constrained binary artificial bee colony to minimize the makespan for single machine batch processing with non-identical job sizes. Applied Soft Computing 29, pages 379-385.
Crossref
Yasothei Suppiah & Mohamed K. Omar. (2014) A hybrid tabu search for batching and sequencing decisions in a single machine environment. Computers & Industrial Engineering 78, pages 135-147.
Crossref
Liji Shen, Lars Mönch & Udo Buscher. (2013) A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. Journal of Scheduling 17:5, pages 471-487.
Crossref
Wenhua Li, Jinjiang Yuan & Sufang Yang. (2014) Online scheduling of incompatible unit-length job families with lookahead. Theoretical Computer Science 543, pages 120-125.
Crossref
Li Li Liu. (2013) Online Scheduling with Incompatible Job Families on Batch Processing Machine(s). Applied Mechanics and Materials 345, pages 408-411.
Crossref
Wenyou Jia, Zhibin Jiang & You Li. (2013) A job-family-oriented algorithm for re-entrant batch processing machine scheduling. A job-family-oriented algorithm for re-entrant batch processing machine scheduling.
Ruyan Fu, T.C.E. Cheng, C.T. Ng & Jinjiang Yuan. (2013) An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. Operations Research Letters 41:3, pages 216-219.
Crossref
Stéphane Dauzère-Pérès & Lars Mönch. (2013) Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective. Computers & Operations Research 40:5, pages 1224-1233.
Crossref
Maurizio Boccia, Giuseppe Bruno & Claudio Sterle. (2013) A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry. A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry.
Arnaud Malapert, Christelle Guéret & Louis-Martin Rousseau. (2012) A constraint programming approach for a batch processing problem with non-identical job sizes. European Journal of Operational Research 221:3, pages 533-545.
Crossref
Wenjie Li, Zhenkun Zhang, Hailing Liu & Jinjiang Yuan. (2012) Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs. Information Processing Letters 112:12, pages 503-508.
Crossref
Jorick Lartigau, Lanshun Nie, Xiaofei Xu, Dechen Zhan & Tehani Mou. (2012) Scheduling Methodology for Production Services in Cloud Manufacturing. Scheduling Methodology for Production Services in Cloud Manufacturing.
Shiqing Yao, Zhibin Jiang & Na Li. (2012) A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. Computers & Operations Research 39:5, pages 939-951.
Crossref
Oleh Sobeyko & Lars Monch. (2011) A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs. A comparison of heuristics to solve a single machine batching problem with unequal ready times of the jobs.
Yu-Ting Kao, Shun-Cheng Zhan, Shi-Chung Chang, Jen-Hsuan Ho, Peng Wang, Peter B. Luh, Simon Wang, Fenix Wang & Joey Chang. (2011) Near optimal furnace tool allocation with batching and waiting time constraints. Near optimal furnace tool allocation with batching and waiting time constraints.
Dirk Doleschal, Andreas Klemmt & Gerald Weigert. (2011) Iterative simulation-based optimization for parallel batch scheduling problems. Iterative simulation-based optimization for parallel batch scheduling problems.
Ji Tian, T.C.E. Cheng, C.T. Ng & Jinjiang Yuan. (2011) Online scheduling on unbounded parallel-batch machines with incompatible job families. Theoretical Computer Science 412:22, pages 2380-2386.
Crossref
Konstantin Chakhlevitch, Celia A. Glass & Hans Kellerer. (2011) Batch machine production with perishability time windows and limited batch size. European Journal of Operational Research 210:1, pages 39-47.
Crossref
Yeong-Dae Kim, Jae-Hun Kang, Gyeong-Eun Lee & Seung-Kil Lim. (2011) Scheduling Algorithms for Minimizing Tardiness of Orders at the Burn-in Workstation in a Semiconductor Manufacturing System. IEEE Transactions on Semiconductor Manufacturing 24:1, pages 14-26.
Crossref
Tsung-Che Chiang, Hsueh-Chien Cheng & Li-Chen Fu. (2010) A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival. Computers & Operations Research 37:12, pages 2257-2269.
Crossref
Yeong-Dae Kim, Byung-Jun Joo & So-Young Choi. (2010) Scheduling Wafer Lots on Diffusion Machines in a Semiconductor Wafer Fabrication Facility. IEEE Transactions on Semiconductor Manufacturing 23:2, pages 246-254.
Crossref
Andreas Klemmt, Gerald Weigert, Christian Almeder & Lars Monch. (2009) A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems. A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems.
Tanju Yurtsever, Erhan Kutanoglu & Jennifer Johns. (2009) Heuristic based scheduling system for diffusion in semiconductor manufacturing. Heuristic based scheduling system for diffusion in semiconductor manufacturing.
Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph (Seffi) Naor, Baruch Schieber & Hadas Shachnai. (2009) Throughput maximization of real-time scheduling with batching. ACM Transactions on Algorithms 5:2, pages 1-17.
Crossref
Tsung-Che Chiang, Hsueh-Chien Cheng & Li-Chen Fu. (2008) An Efficient Heuristic for Minimizing Maximum Lateness on Parallel Batch Machines. An Efficient Heuristic for Minimizing Maximum Lateness on Parallel Batch Machines.
Hsueh-Chien Cheng, Tsung-Che Chiang & Li-Chen Fu. (2008) A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals. A memetic algorithm for parallel batch machine scheduling with incompatible job families and dynamic job arrivals.
L. Monch. (2008) Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines. Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines.
Reha Uzsoy & Juan Diego Velásquez. (2008) Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times. Computers & Operations Research 35:6, pages 2018-2033.
Crossref
Ali Husseinzadeh Kashan, Behrooz Karimi & Masoud Jenabi. (2008) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Computers & Operations Research 35:4, pages 1084-1098.
Crossref
Vishnu Erramilli & Scott J. Mason. (2006) Multiple Orders Per Job Compatible Batch Scheduling. IEEE Transactions on Electronics Packaging Manufacturing 29:4, pages 285-296.
Crossref
N.R. Raghavan & M. Venkataramana. (2006) Scheduling Parallel Batch Processors with Incompatible Job Families Using Ant Colony Optimization. Scheduling Parallel Batch Processors with Incompatible Job Families Using Ant Colony Optimization.
A.K. Gupta & A.I. Sivakumar. (2006) Optimization of due-date objectives in scheduling semiconductor batch manufacturing. International Journal of Machine Tools and Manufacture 46:12-13, pages 1671-1679.
Crossref
Lars Mönch, Jens Zimmermann & Peter Otto. (2006) Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines. Engineering Applications of Artificial Intelligence 19:3, pages 235-245.
Crossref
Giovanni Miragliotta & Marco Perona. (2005) Decentralised, multi-objective driven scheduling for reentrant shops: A conceptual development and a test case. European Journal of Operational Research 167:3, pages 644-662.
Crossref
Lars Mönch, Hari Balasubramanian, John W. Fowler & Michele E. Pfund. (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research 32:11, pages 2731-2750.
Crossref
Shie-Gheun Koh, Pyung-Hoi Koo, Dong-Chun Kim & Won-Suk Hur. (2005) Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. International Journal of Production Economics 98:1, pages 81-96.
Crossref
Imelda C. Perez, John W. Fowler & W.Matthew Carlyle. (2005) Minimizing total weighted tardiness on a single batch process machine with incompatible job families. Computers & Operations Research 32:2, pages 327-341.
Crossref
Reuven Bar-Yehuda, Keren Bendel, Ari Freund & Dror Rawitz. 2005. Graph Theory, Combinatorics and Algorithms. Graph Theory, Combinatorics and Algorithms
107
143
.
Chang Sup Sung & Young Hwan Kim. (2003) Minimizing due date related performance measures on two batch processing machines. European Journal of Operational Research 147:3, pages 644-656.
Crossref
Cheng-Shuo Wang & Reha Uzsoy. (2002) A genetic algorithm to minimize maximum lateness on a batch processing machine. Computers & Operations Research 29:12, pages 1621-1640.
Crossref
Chang Sup Sung & Young Hwan Kim. (2002) Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computers & Operations Research 29:3, pages 275-294.
Crossref
Meral Azizoglu & Scott Webster. (2001) Scheduling a batch processing machine with incompatible job families. Computers & Industrial Engineering 39:3-4, pages 325-335.
Crossref
Xiangtong Qi & Fengsheng Tu. (1999) Earliness and tardiness scheduling problems on a batch processor. Discrete Applied Mathematics 98:1-2, pages 131-145.
Crossref
Fariborz Jolai Ghazvini & Lionel Dupont. (1998) Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes. International Journal of Production Economics 55:3, pages 273-280.
Crossref