Citations (168)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (41)
Zhaohui Li & Guohua Wan. (2023) Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms. International Journal of Production Research 61:17, pages 5934-5955.
Read now
Read now
M. Vimala Rani & Muthu Mathirajan. (2023) A state-of-art review and a simple meta-analysis on deterministic scheduling of diffusion furnaces in semiconductor manufacturing. International Journal of Production Research 61:16, pages 5744-5771.
Read now
Read now
Christian Gahm, Stefan Wahl & Axel Tuma. (2022) Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes. International Journal of Production Research 60:17, pages 5131-5154.
Read now
Read now
Yong Jae Kim, Jae Won Jang, David S. Kim & Byung Soo Kim. (2022) Batch loading and scheduling problem with processing time deterioration and rate-modifying activities. International Journal of Production Research 60:5, pages 1600-1620.
Read now
Read now
Jingying Huang, Liya Wang & Zhibin Jiang. (2020) A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance. International Journal of Production Research 58:13, pages 4086-4102.
Read now
Read now
Yonglin Li & Zhenhua Dai. (2020) A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time. Engineering Optimization 52:3, pages 484-506.
Read now
Read now
Zewen Huang, Zhongshun Shi & Leyuan Shi. (2019) Minimising total weighted completion time on batch and unary machines with incompatible job families. International Journal of Production Research 57:2, pages 567-581.
Read now
Read now
Zhongshun Shi, Zewen Huang & Leyuan Shi. (2018) Customer order scheduling on batch processing machines with incompatible job families. International Journal of Production Research 56:1-2, pages 795-808.
Read now
Read now
Cheng Zhang, Zhongshun Shi, Zewen Huang, Yifan Wu & Leyuan Shi. (2017) Flow shop scheduling with a batch processor and limited buffer. International Journal of Production Research 55:11, pages 3217-3233.
Read now
Read now
Onur Ozturk, Mehmet A. Begen & Gregory S. Zaric. (2017) A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. International Journal of Production Research 55:6, pages 1815-1831.
Read now
Read now
XiaoLin Li, YuPeng Li & Yu Wang. (2017) Minimising makespan on a batch processing machine using heuristics improved by an enumeration scheme. International Journal of Production Research 55:1, pages 176-186.
Read now
Read now
Zhili Tian, Panos Kouvelis & Charles L. Munson. (2015) Understanding and managing product line complexity: Applying sensitivity analysis to a large-scale MILP model to price and schedule new customer orders. IIE Transactions 47:4, pages 307-328.
Read now
Read now
Wenyou Jia, Zhibin Jiang & You Li. (2013) Closed loop control-based real-time dispatching heuristic on parallel batch machines with incompatible job families and dynamic arrivals. International Journal of Production Research 51:15, pages 4570-4584.
Read now
Read now
Eray Cakici, Scott
J. Mason, John
W. Fowler & H. Neil Geismar. (2013) Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families. International Journal of Production Research 51:8, pages 2462-2477.
Read now
Read now
W.L. Pearn, J.S. Hong & Y.T. Tai. (2013) The burn-in test scheduling problem with batch dependent processing time and sequence dependent setup time. International Journal of Production Research 51:6, pages 1694-1706.
Read now
Read now
John
Benedict C. Tajan, Appa
Iyer Sivakumar & Stanley
B. Gershwin. (2012) Heuristic control of multiple batch processors with incompatible job families and future job arrivals. International Journal of Production Research 50:15, pages 4206-4219.
Read now
Read now
Claude Yugma, Stéphane Dauzère-Pérès, Christian Artigues, Alexandre Derreumaux & Olivier Sibille. (2012) A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing. International Journal of Production Research 50:8, pages 2118-2132.
Read now
Read now
R Zheng, H Li & X Zhang. (2012) Scheduling an unbounded batching machine with family jobs and setup times. Journal of the Operational Research Society 63:2, pages 160-167.
Read now
Read now
Ravindra Gokhale & M. Mathirajan. (2011) Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing. International Journal of Production Research 49:10, pages 2705-2728.
Read now
Read now
Yu-Ting Tai & Chun-Mei Lai. (2011) The liquid crystal injection scheduling problem (LCISP). International Journal of Production Research 49:2, pages 467-484.
Read now
Read now
Seok
Ho Chang & StanleyB. Gershwin. (2010) Modeling and analysis of two unreliable batch machines with a finite buffer in between. IIE Transactions 42:6, pages 405-421.
Read now
Read now
A H Kashan & B Karimi. (2008) Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework. Journal of the Operational Research Society 59:9, pages 1269-1280.
Read now
Read now
Christopher D. Geiger & Reha Uzsoy. (2008) Learning effective dispatching rules for batch processor scheduling. International Journal of Production Research 46:6, pages 1431-1454.
Read now
Read now
Fuh-Der Chou & Hui-Mei Wang. (2008) SCHEDULING FOR A SINGLE SEMICONDUCTOR BATCH-PROCESSING MACHINE TO MINIMIZE TOTAL WEIGHTED TARDINESS. Journal of the Chinese Institute of Industrial Engineers 25:2, pages 136-147.
Read now
Read now
Mary E. Kurz & Scott J. Mason. (2008) Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times. International Journal of Production Research 46:1, pages 131-151.
Read now
Read now
D. J. Van Der Zee. (2007) Dynamic scheduling of batch-processing machines with non-identical product sizes. International Journal of Production Research 45:10, pages 2327-2349.
Read now
Read now
S. K. Tangudu & M. E. Kurz. (2006) A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families. Production Planning & Control 17:7, pages 728-741.
Read now
Read now
A. H. Kashan, B. Karimi & F. Jolai. (2006) Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes. International Journal of Production Research 44:12, pages 2337-2360.
Read now
Read now
D. J. Van Der Zee
. (2004) Dynamic scheduling of batch servers with compatible product families. International Journal of Production Research 42:22, pages 4803-4826.
Read now
Read now
H. J. Shin
& V. J. Leon. (2004) Scheduling with product family set-up times: an application in TFT LCD manufacturing. International Journal of Production Research 42:20, pages 4235-4248.
Read now
Read now
P.-Y. Chang, P. Damodaran
& S. Melouk. (2004) Minimizing makespan on parallel batch processing machines. International Journal of Production Research 42:19, pages 4211-4220.
Read now
Read now
Shie-Gheun Koh
, Pyung-Hoi Koo, Jae-Won Ha & Woon-Seek Lee. (2004) Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families. International Journal of Production Research 42:19, pages 4091-4107.
Read now
Read now
M. Mathirajan, Appa
Iyer Sivakumar & Vijay Chandru. (2004) SCHEDULING ALGORITHMS AND SENSITIVITY ANALYSIS FOR HETEROGENEOUS BATCH PROCESSORS WITH INCOMPATIBLE JOB FAMILIES. Journal of the Chinese Institute of Industrial Engineers 21:1, pages 18-26.
Read now
Read now
ScottJ. Mason & Kasin Oey. (2003) Scheduling complex job shops using disjunctive graphs: A cycle elimination procedure. International Journal of Production Research 41:5, pages 981-994.
Read now
Read now
KRISTINA. THONEY, THOMJ. HODGSON, RUSSELLE. KING, MEHMETR. TANER & AMYD. WILSON. (2002) Satisfying due-dates in large multi-factory supply chains. IIE Transactions 34:9, pages 803-811.
Read now
Read now
T.C.E. CHENG & M.Y. KOVALYOV. (2001) Single machine batch scheduling with sequential job processing. IIE Transactions 33:5, pages 413-420.
Read now
Read now
Jung-Te Wang, Maw-Sheng Chern & Dar-Li Yang. (2001) A TWO-MACHINE MULTI-FAMILY FLOWSHOP SCHEDULING PROBLEM WITH TWO BATCH PROCESSORS. Journal of the Chinese Institute of Industrial Engineers 18:3, pages 77-85.
Read now
Read now
JOHNW. FOWLER, GARYL. HOGG & DONT. PHILLIPS. (2000) Control of multiproduct bulk server diffusion/oxidation processes. Part 2: multiple servers. IIE Transactions 32:2, pages 167-176.
Read now
Read now
SANJAYV. MEHTA & REHA UZSOY. (1998) Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions 30:2, pages 165-178.
Read now
Read now
Dong Wang, Kan Fang, Wenchang Luo & Wenli Ouyang. Approximation algorithms for mixed batch scheduling on parallel machines. Journal of the Operational Research Society 0:0, pages 1-10.
Read now
Read now
Deming Lei & Tao Dai. An adaptive shuffled frog-leaping algorithm for parallel batch processing machines scheduling with machine eligibility in fabric dyeing process. International Journal of Production Research 0:0, pages 1-18.
Read now
Read now
Articles from other publishers (127)
Daniel Sascha Schorn & Lars Mönch. (2024) Learning Priority Indices for Energy-Aware Scheduling of Jobs on Batch Processing Machines. IEEE Transactions on Semiconductor Manufacturing 37:1, pages 3-15.
Crossref
Crossref
Jinfeng WangJinfeng Wang. 2024. Intelligent Manufacturing System and Intelligent Workshop. Intelligent Manufacturing System and Intelligent Workshop
109
167
.
Lindong Liu, Zhenyu Wu & Yugang Yu. (2023) A branch-and-price algorithm to perform single-machine scheduling for additive manufacturing. Journal of Management Science and Engineering 8:2, pages 273-286.
Crossref
Crossref
Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz & Felix Winter. (2023) Exact methods for the Oven Scheduling Problem. Constraints 28:2, pages 320-361.
Crossref
Crossref
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 15:5, pages 3934.
Crossref
Crossref
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.
Orlando Rivera Letelier, François Clautiaux & Ruslan Sadykov. (2022) Bin Packing Problem with Time Lags. INFORMS Journal on Computing 34:4, pages 2249-2270.
Crossref
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
Crossref
Lingxuan Liu & Leyuan Shi. (2022) Automatic Design of Efficient Heuristics for Two-Stage Hybrid Flow Shop Scheduling. Symmetry 14:4, pages 632.
Crossref
Crossref
Jae Won Jang, Yong Jae Kim & Byung Soo Kim. (2022) A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities. Mathematics 10:4, pages 657.
Crossref
Crossref
Lili Liu. (2021) Batch scheduling with incompatible job families and common due date. Journal of Physics: Conference Series 2010:1, pages 012023.
Crossref
Crossref
Shubin Xu & John Wang. 2021. Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms. Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms
928
946
.
M. Vimala Rani & M. Mathirajan. 2021. Supply Chain Management in Manufacturing and Service Systems. Supply Chain Management in Manufacturing and Service Systems
241
278
.
Jens Rocholl, Lars Mönch & John Fowler. (2020) Bi-criteria parallel batch machine scheduling to minimize total weighted tardiness and electricity cost. Journal of Business Economics 90:9, pages 1345-1381.
Crossref
Crossref
Jun-Qiang Wang, Guo-Qiang Fan & Zhixin Liu. (2019) Mixed batch scheduling on identical machines. Journal of Scheduling 23:4, pages 487-496.
Crossref
Crossref
M. Vimala Rani & M. Mathirajan. (2019) Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace. OPSEARCH 57:2, pages 462-512.
Crossref
Crossref
Paul Cayo & Sinan Onal. (2020) A shifting bottleneck procedure with multiple objectives in a complex manufacturing environment. Production Engineering 14:2, pages 177-190.
Crossref
Crossref
Lili Liu & Chunyu Fu. 2020. Algorithmic Aspects in Information and Management. Algorithmic Aspects in Information and Management
537
543
.
Nasrin Alizadeh & Ali Husseinzadeh Kashan. (2019) Enhanced grouping league championship and optics inspired optimization algorithms for scheduling a batch processing machine with job conflicts and non-identical job sizes. Applied Soft Computing 83, pages 105657.
Crossref
Crossref
XiaoLin Li, YuPeng Li & YanLi Huang. (2019) Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families. Computers & Operations Research 106, pages 91-101.
Crossref
Crossref
José Elias C. Arroyo, Joseph Y.-T. Leung & Ricardo Gonçalves Tavares. (2019) An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times. Engineering Applications of Artificial Intelligence 77, pages 239-254.
Crossref
Crossref
Shubin Xu & John Wang. (2018) An Efficient Batch Scheduling Model for Hospital Sterilization Services Using Genetic Algorithm. International Journal of Strategic Decision Sciences 9:1, pages 1-17.
Crossref
Crossref
Shuguang Li. (2017) Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities. European Journal of Operational Research 263:3, pages 815-826.
Crossref
Crossref
Omid Shahvari & Rasaratnam Logendran. (2017) A bi-objective batch processing problem with dual-resources on unrelated-parallel machines. Applied Soft Computing 61, pages 174-192.
Crossref
Crossref
Andy Ham, John W. Fowler & Eray Cakici. (2017) Constraint Programming Approach for Scheduling Jobs With Release Times, Non-Identical Sizes, and Incompatible Families on Parallel Batching Machines. IEEE Transactions on Semiconductor Manufacturing 30:4, pages 500-507.
Crossref
Crossref
Maria Hulett, Purushothaman Damodaran & Mahbod Amouie. (2017) Scheduling non-identical parallel batch processing machines to minimize total weighted tardiness using particle swarm optimization. Computers & Industrial Engineering 113, pages 425-436.
Crossref
Crossref
Andy Ham & John Fowler. (2017) Constraint programming approach for scheduling batch operations with incompatible job families in fab and compatible job families in backend: FA: Factory automation. Constraint programming approach for scheduling batch operations with incompatible job families in fab and compatible job families in backend: FA: Factory automation.
José Elias C. Arroyo & Joseph Y.-T. Leung. (2017) An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Computers & Industrial Engineering 105, pages 84-100.
Crossref
Crossref
Zhaohong Jia, Xiaohao Li & Joseph Y.-T. Leung. (2017) Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities. Future Generation Computer Systems 67, pages 22-34.
Crossref
Crossref
José Elias C. Arroyo & Joseph Y.-T. Leung. (2017) Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Computers & Operations Research 78, pages 117-128.
Crossref
Crossref
Zhao-Hong Jia, Ting-Ting Wen, Joseph Y.-T. Leung & Kai Li. (2017) Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times. Journal of Industrial & Management Optimization 13:2, pages 977-993.
Crossref
Crossref
Zhongshun Shi, Zewen Huang & Leyuan Shi. (2016) Two-stage flow shop with a batch processor and limited buffer. Two-stage flow shop with a batch processor and limited buffer.
S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam & F. Hosseinzadeh Lotfi. (2015) A modified imperialist competitive algorithm for scheduling single batch-processing machine with fuzzy due date. The International Journal of Advanced Manufacturing Technology 85:9-12, pages 2439-2458.
Crossref
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
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
Crossref
Zhao-hong Jia, Kai Li & Joseph Y.-T. Leung. (2015) Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities. International Journal of Production Economics 169, pages 1-10.
Crossref
Crossref
Zhao-hong Jia & Joseph Y.-T. Leung. (2015) A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. European Journal of Operational Research 240:3, pages 649-665.
Crossref
Crossref
Eray Cakici, Scott J. Mason, H. Neil Geismar & John W. Fowler. (2014) Scheduling parallel machines with single vehicle delivery. Journal of Heuristics 20:5, pages 511-537.
Crossref
Crossref
Che-Wei Chou, Chen-Fu Chien & Mitsuo Gen. (2014) A Multiobjective Hybrid Genetic Algorithm for TFT-LCD Module Assembly Scheduling. IEEE Transactions on Automation Science and Engineering 11:3, pages 692-705.
Crossref
Crossref
Shi-Sheng Li & Ren-Xia Chen. (2014) Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs. Computers & Industrial Engineering 73, pages 5-10.
Crossref
Crossref
Ravindra Gokhale & M. Mathirajan. (2013) Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families. The International Journal of Advanced Manufacturing Technology 70:9-12, pages 1563-1578.
Crossref
Crossref
Jun-lin Chang, Ying Chen & Xiao-ping Ma. (2013) A hybrid particle swarm optimization algorithm for parallel batch processing machines scheduling. A hybrid particle swarm optimization algorithm for parallel batch processing machines scheduling.
Li Li Liu. (2013) Online Scheduling with Incompatible Job Families on Batch Processing Machine(s). Applied Mechanics and Materials 345, pages 408-411.
Crossref
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.
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
Crossref
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
247
266
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
207
246
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
177
205
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
105
175
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
65
104
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
29
64
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
11
28
.
Lars Mönch, John W. Fowler & Scott J. MasonLars Mönch, John W. Fowler & Scott J. Mason. 2013. Production Planning and Control for Semiconductor Wafer Fabrication Facilities. Production Planning and Control for Semiconductor Wafer Fabrication Facilities
1
10
.
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
Crossref
Frank S. Yao, Mei Zhao & Hui Zhang. (2012) Two-stage hybrid flow shop scheduling with dynamic job arrivals. Computers & Operations Research 39:7, pages 1701-1712.
Crossref
Crossref
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
Crossref
Jintao Meng & Zhiyong Li. 2012. Software Engineering and Knowledge Engineering: Theory and Practice. Software Engineering and Knowledge Engineering: Theory and Practice
935
941
.
John Benedict C. Tajan, Appa Iyer Sivakumar & Stanley B. Gershwin. (2011) Control of a Single Batch Processor With Incompatible Job Families and Future Job Arrivals. IEEE Transactions on Semiconductor Manufacturing 24:2, pages 208-222.
Crossref
Crossref
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
Crossref
Konstantin Chakhlevitch, Celia A. Glass & Peter A. Sadd. (2011) Alleviating bottlenecks in a microbiology laboratory. Journal of Food Engineering 103:4, pages 377-387.
Crossref
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
Crossref
Li-Man Liao & Ching-Jen Huang. (2011) Tabu search heuristic for two-machine flowshop with batch processing machines. Computers & Industrial Engineering 60:3, pages 426-432.
Crossref
Crossref
Jintao Meng & Xiaoxu Lu. (2011) The Bounded Single-Machine Parallel-batching Scheduling Problem with Family Jobs for Minimizing Makespan. Procedia Environmental Sciences 10, pages 374-378.
Crossref
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
Crossref
L. L. Liu, C. T. Ng & T. C. E. Cheng. (2010) On the complexity of bi-criteria scheduling on a single batch processing machine. Journal of Scheduling 13:6, pages 629-638.
Crossref
Crossref
Ali Husseinzadeh Kashan, Behrooz Karimi & Fariborz Jolai. (2010) An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes. Engineering Applications of Artificial Intelligence 23:6, pages 911-922.
Crossref
Crossref
Meng Jintao, Yu Jun & Lu Xiaoxu. (2010) Parallel-batching scheduling problem with family jobs for minimizing makespan. Parallel-batching scheduling problem with family jobs for minimizing makespan.
Meng Jintao & Lu Xiaoxu. (2010) The single-machine parallel-batching scheduling problem with family jobs to minimize makespan. The single-machine parallel-batching scheduling problem with family jobs to minimize makespan.
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
Crossref
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.
Rui Zheng & Hongyu Li. (2009) Minimizing weighted number of tardy jobs on unbounded single batching machine with family jobs. Minimizing weighted number of tardy jobs on unbounded single batching machine with family jobs.
Shiegheun Koh, Youngjin Kim & Woonseek Lee. (2009) Scheduling two-machine flow shop with a batch processing machine. Scheduling two-machine flow shop with a batch processing machine.
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
Crossref
Ruyan Fu, Ji Tian & Jinjiang Yuan. (2008) On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. Journal of Scheduling 12:1, pages 91-97.
Crossref
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.
Lili Liu & Feng Zhang. (2008) Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible Job Families. Minimizing Number of Tardy Jobs on a Batch Processing Machine with Incompatible Job Families.
Purushothaman Damodaran & Ping-Yu Chang. (2007) Heuristics to minimize makespan of parallel batch processing machines. The International Journal of Advanced Manufacturing Technology 37:9-10, pages 1005-1013.
Crossref
Crossref
Claude Yugma, Stephane Dauzere-Peres, Alexandre Derreumaux & Olivier Sibille. (2008) A Batch Optimization Sofware for diffusion area scheduling in semiconductor manufacturing. A Batch Optimization Sofware for diffusion area scheduling in semiconductor manufacturing.
Yang Jianhua. (2008) Manufacturing Execution System for Knitting Industry. Manufacturing Execution System for Knitting Industry.
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
Crossref
Vishnu Erramilli & Scott J. Mason. (2007) Multiple orders per job batch scheduling with incompatible jobs. Annals of Operations Research 159:1, pages 245-260.
Crossref
Crossref
Fehmi Tanrisever & Erhan Kutanoglu. (2007) Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem. Annals of Operations Research 159:1, pages 5-24.
Crossref
Crossref
Qingqin Nong, Jinjiang Yuan, Ruyan Fu, Lin Lin & Ji Tian. (2008) The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan. International Journal of Production Economics 111:2, pages 435-440.
Crossref
Crossref
. 2008. Resource‐Constrained Project Scheduling. Resource‐Constrained Project Scheduling
279
301
.
Sujay Malve & Reha Uzsoy. (2007) A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families. Computers & Operations Research 34:10, pages 3016-3028.
Crossref
Crossref
M. Mathirajan, V. Chandru & A. I. Sivakumar. (2008) Heuristic algorithms for scheduling heat-treatment furnaces of steel casting industries. Sadhana 32:5, pages 479-500.
Crossref
Crossref
Shubin Xu & James C. Bean. (2007) A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines. A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines.
Salil Pradhan & Sarah S. Y. Lam. (2006) Minimizing makespan during environmental stress screening using a genetic algorithm and an ant colony optimization. The International Journal of Advanced Manufacturing Technology 32:5-6, pages 571-577.
Crossref
Crossref
Karthik Sourirajan & Reha Uzsoy. (2007) Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication. Journal of Scheduling 10:1, pages 41-65.
Crossref
Crossref
M. Mathirajan & A.I. Sivakumar. (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. The International Journal of Advanced Manufacturing Technology 29:9-10, pages 990-1001.
Crossref
Crossref
M. Mathirajan & A. I. Sivakumar. (2006) Minimizing total weighted tardiness on heterogeneous batch processing machines with incompatible job families. The International Journal of Advanced Manufacturing Technology 28:9-10, pages 1038-1047.
Crossref
Crossref
Christopher D. Geiger, Reha Uzsoy & Haldun Aytuğ. (2006) Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach. Journal of Scheduling 9:1, pages 7-34.
Crossref
Crossref
Mourad Boudhar. (2005) Scheduling on a Batch Processing Machine with Split Compatibility Graphs. Journal of Mathematical Modelling and Algorithms 4:4, pages 391-407.
Crossref
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
Crossref
Fariborz Jolai. (2005) Minimizing number of tardy jobs on a batch processing machine with incompatible job families. European Journal of Operational Research 162:1, pages 184-190.
Crossref
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
Crossref
Hark-Chin Hwang & Soo Y. Chang. (2005) Order Consolidation for Batch Processing. Journal of Combinatorial Optimization 9:1, pages 121-138.
Crossref
Crossref
Reuven Bar-Yehuda, Keren Bendel, Ari Freund & Dror Rawitz. 2005. Graph Theory, Combinatorics and Algorithms. Graph Theory, Combinatorics and Algorithms
107
143
.
C. Schwindt & N. Trautmann. (2003) Scheduling the production of rolling ingots: industrial context, model, and solution method. International Transactions in Operational Research 10:6, pages 547-563.
Crossref
Crossref
Yeong-Dae Kim, Sang-Oh Shim, Bum Choi & Hark Hwang. (2003) Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility. IEEE Transactions on Semiconductor Manufacturing 16:2, pages 290-298.
Crossref
Crossref
Christoph Schwindt & Norbert Trautmann. 2003. Operations Research Proceedings 2002. Operations Research Proceedings 2002
83
88
.
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
Crossref
C.S. Sung, Y.I. Choung, J.M. Hong & Y.H. Kim. (2002) Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Computers & Operations Research 29:8, pages 995-1007.
Crossref
Crossref
Lionel Dupont & Clarisse Dhaenens-Flipo. (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Computers & Operations Research 29:7, pages 807-819.
Crossref
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
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
Crossref
Gregory Dobson & Ramakrishnan S. Nambimadom. (2001) The Batch Loading and Scheduling Problem. Operations Research 49:1, pages 52-65.
Crossref
Crossref
K. Oey & S.J. Mason. (2001) Scheduling batch processing machines in complex job shops. Scheduling batch processing machines in complex job shops.
Yeong-Dae Kim, Jae-Gon Kim, Bum Choi & Hyung-Un Kim. (2001) Production scheduling in a semiconductor wafer fabrication facility producing multiple product types with distinct due dates. IEEE Transactions on Robotics and Automation 17:5, pages 589-598.
Crossref
Crossref
A. Devpura, J.W. Fowler, M.W. Carlyle & I. Perez. 2001. Operations Research Proceedings 2000. Operations Research Proceedings 2000
366
371
.
Bo Chen, Xiaotie Deng & Wenan Zang. 2001. Algorithms and Computation. Algorithms and Computation
380
389
.
C. N. Potts, V. A. Strusevich & T. Tautenhahn. (2001) Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling 4:1, pages 25-51.
Crossref
Crossref
Mourad Boudhar & Gerd Finke. (2000) Scheduling on Batch Processing Machines with Constraints of Compatibility Between Jobs. IFAC Proceedings Volumes 33:17, pages 703-708.
Crossref
Crossref
C.S. Sung & Y.I. Choung. (2000) Minimizing makespan on a single burn-in oven in semiconductor manufacturing. European Journal of Operational Research 120:3, pages 559-574.
Crossref
Crossref
E. Akcali, R. Uzsoy, D.G. Hiscock, A.L. Moser & T.J. Teyner. (2000) Alternative loading and dispatching policies for furnace operations in semiconductor manufacturing: a comparison by simulation. Alternative loading and dispatching policies for furnace operations in semiconductor manufacturing: a comparison by simulation.
Xiangtong Qi & Fengsheng Tu. (1999) Earliness and tardiness scheduling problems on a batch processor. Discrete Applied Mathematics 98:1-2, pages 131-145.
Crossref
Crossref
Alok Aggarwal & C. Pandu RanganXiaotie Deng, Chung Keung Poon & Yuzhong Zhang. 1999. Algorithms and Computation. Algorithms and Computation
153
162
.
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
Crossref
Kim Yeong-Dae, Lee Dong-Ho, Kim Jung-Ug & Roh Hwan-Kyun. (1998) A simulation study on lot release control, mask scheduling, and batch scheduling in semiconductor wafer fabrication facilities. Journal of Manufacturing Systems 17:2, pages 107-117.
Crossref
Crossref
R. Uzsoy & Cheng-Shuo Wang. (1997) Decomposition procedures for global scheduling of complex job shops. Decomposition procedures for global scheduling of complex job shops.
J. Wang & P.B. Luh. (1997) Scheduling Job Shops with Batch Machines Using the Lagrangian Relaxation Technique. European Journal of Control 3:4, pages 268-279.
Crossref
Crossref
P.B. Luh, J.H. Wang, J.L. Wang, R.N. Tomastik & T.D. Howes. (1997) Near-Optimal Scheduling of Manufacturing Systems with Presence of Batch Machines and Setup Requirements. CIRP Annals 46:1, pages 397-402.
Crossref
Crossref
Irfan M. Ovacik & Reha UzsoyIrfan M. Ovacik & Reha Uzsoy. 1997. Decomposition Methods for Complex Factory Scheduling Problems. Decomposition Methods for Complex Factory Scheduling Problems
203
211
.
D. Kayton, T. Teyner, C. Schwartz & R. Uzsoy. (1996) Effects of dispatching and down time on the performance of wafer fabs operating under theory of constraints. Effects of dispatching and down time on the performance of wafer fabs operating under theory of constraints.
E. Demirkol, R. Uzsoy & I.M. Ovacik. (1995) Decomposition algorithms for scheduling semiconductor testing facilities. Decomposition algorithms for scheduling semiconductor testing facilities.