Citations (163)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (39)
Ting Zhao, Shaojun Lu, Hao Cheng, Mingyu Ren & Xinbao Liu. (2023) Coordinated production and delivery scheduling for service-oriented manufacturing systems with deterioration effect. International Journal of Production Research 0:0, pages 1-20.
Read now
Read now
Guo-Qiang Fan, Jun-Qiang Wang & Zhixin Liu. (2023) Two-agent scheduling on mixed batch machines to minimise the total weighted makespan. International Journal of Production Research 61:1, pages 238-257.
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
Zhen Chen, Xu Zheng, Shengchao Zhou, Chuang Liu & Huaping Chen. (2020) Quantum-inspired ant colony optimisation algorithm for a two-stage permutation flow shop with batch processing machines. International Journal of Production Research 58:19, pages 5945-5963.
Read now
Read now
Zhao-hong Jia, Si-yun Huo, Kai Li & Hua-ping Chen. (2020) Integrated scheduling on parallel batch processing machines with non-identical capacities. Engineering Optimization 52:4, pages 715-730.
Read now
Read now
Daniel Oron. (2019) Batching and resource allocation decisions on an m-machine proportionate flowshop. Journal of the Operational Research Society 70:9, pages 1571-1578.
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
Shengchao Zhou, Huaping Chen, Rui Xu & Xueping Li. (2014) Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes. International Journal of Production Research 52:8, pages 2258-2274.
Read now
Read now
XiaoLin Li, HuaPing Chen, Bing Du & Qi Tan. (2013) Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals. International Journal of Computer Integrated Manufacturing 26:5, pages 474-486.
Read now
Read now
J.J. Liu, Q.X. Chen, N. Mao & X.D. Chen. (2013) Bi-objective dynamic control of batch processor with non-identical jobs in mould manufacturing. International Journal of Production Research 51:6, pages 1820-1835.
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
Huaping Chen, Bing Du & George
Q. Huang. (2011) Scheduling a batch processing machine with non-identical job sizes: a clustering perspective. International Journal of Production Research 49:19, pages 5755-5778.
Read now
Read now
Hui-Mei Wang. (2011) Solving single batch-processing machine problems using an iterated heuristic. International Journal of Production Research 49:14, pages 4245-4261.
Read now
Read now
Kristy Crist & Reha Uzsoy. (2011) Prioritising production and engineering lots in wafer fabrication facilities: a simulation study. International Journal of Production Research 49:11, pages 3105-3125.
Read now
Read now
Huaping Chen, Bing Du & GeorgeQ. Huang. (2010) Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals. International Journal of Computer Integrated Manufacturing 23:10, pages 942-956.
Read now
Read now
Jun Jia & Scott J. Mason. (2009) Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. International Journal of Production Research 47:10, pages 2565-2585.
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
Amit Kumar Gupta & Appa Iyer Sivakumar. (2007) Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching. International Journal of Production Research 45:3, pages 591-613.
Read now
Read now
Hui-Mei Wang, Pei-Chann Chang & Fuh-Der Chou. (2007) A HYBRID FORWARD/BACKWARD APPROACH FOR SINGLE BATCH SCHEDULING PROBLEMS WITH NON-IDENTICAL JOB SIZES. Journal of the Chinese Institute of Industrial Engineers 24:3, pages 191-199.
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
A. Barua, N. Raghavan, A. Upasani & R. Uzsoy
. (2005) Implementing global factory schedules in the face of stochastic disruptions. International Journal of Production Research 43:4, pages 793-818.
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
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
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
D. J. Van Der Zee. (2002) Adaptive scheduling of batch servers in flow shops. International Journal of Production Research 40:12, pages 2811-2833.
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
JOSEA. VENTURA & DAECHEOL KIM. (2000) Parallel machine scheduling about an unrestricted due date and additional resource constraints. IIE Transactions 32:2, pages 147-153.
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
CHANGSUP SUNG & SANGHUM YOON. (1997) MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED. Engineering Optimization 28:3, pages 231-243.
Read now
Read now
M. P. FANTI, B. MAIONE, G. PISCITELLI & B. TURCHIANO. (1996) Heuristic scheduling of jobs on a multi-product batch processing machine. International Journal of Production Research 34:8, pages 2163-2186.
Read now
Read now
R. UZSOY. (1995) Scheduling batch processing machines with incompatible job families. International Journal of Production Research 33:10, pages 2685-2708.
Read now
Read now
REHA UZSOY, CHUNG-YEE LEE & LOUISA. MARTIN-VEGA. (1994) A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART II: SHOP-FLOOR CONTROL. IIE Transactions 26:5, pages 44-55.
Read now
Read now
R. UZSOY. (1994) Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research 32:7, pages 1615-1635.
Read now
Read now
Articles from other publishers (124)
Han Zhang, Kai Li, Zhao-hong Jia & Chengbin Chu. (2023) Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization. European Journal of Operational Research 309:3, pages 1024-1046.
Crossref
Crossref
Alessandro Druetto, Erica Pastore & Elena Rener. (2022) Parallel batching with multi-size jobs and incompatible job families. TOP 31:2, pages 440-458.
Crossref
Crossref
Dangdang Niu, Bin Liu, Hongming Zhang & Minghao Yin. (2022) Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm. Knowledge-Based Systems 246, pages 108703.
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.
Jun Xu, Jun-Qiang Wang & Zhixin Liu. (2022) Parallel batch scheduling: Impact of increasing machine capacity. Omega 108, pages 102567.
Crossref
Crossref
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
Hongbin Zhang, Yu Yang & Feng Wu. (2022) Just-in-time single-batch-processing machine scheduling. Computers & Operations Research 140, pages 105675.
Crossref
Crossref
Chia-Nan Wang, Glen Andrew Porter, Ching-Chien Huang, Viet Tinh Nguyen & Syed Tam Husain. (2022) Flow-Shop Scheduling with Transportation Capacity and Time Consideration. Computers, Materials & Continua 70:2, pages 3031-3048.
Crossref
Crossref
Yan Liang & Qingdong Zhang. (2021) A Non-Dominated Genetic Algorithm Based on Decoding Rule of Heat Treatment Equipment Volume and Job Delivery Date. Algorithms 14:11, pages 310.
Crossref
Crossref
N. Rafiee Parsa, T. Keshavarz, B. Karimi & S. M. Moattar Husseini. (2019) A hybrid neural network approach to minimize total completion time on a single batch processing machine. International Transactions in Operational Research 28:5, pages 2867-2899.
Crossref
Crossref
Dangdang Niu, Bin Liu & Minghao Yin. (2021) Local search for weighted sum coloring problem. Applied Soft Computing 106, pages 107290.
Crossref
Crossref
Shengchao Zhou, Lining Xing, Xu Zheng, Ni Du, Ling Wang & Qingfu Zhang. (2021) A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times. IEEE Transactions on Cybernetics 51:3, pages 1430-1442.
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
.
Dhaval Jayendrakumar Pujara & Muthu Mathirajan. (2020) Mixed Integer Linear Programming Model for Scheduling Burn-in Ovens to Minimize Total Weighted Earliness/Lateness. Mixed Integer Linear Programming Model for Scheduling Burn-in Ovens to Minimize Total Weighted Earliness/Lateness.
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
Han Zhang, Zhao-hong Jia & Kai Li. (2020) Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines. Computers & Operations Research 117, pages 104889.
Crossref
Crossref
Pedram Beldar, Jose M. Framinan & Allahyar Ardakani. (2019) Minimization of total completion time on a batch processing machine with arbitrary release dates: an effectual teaching–learning based optimization approach. Production Engineering 13:5, pages 557-566.
Crossref
Crossref
Hua Gong, Xiaojuan Shu, Fang Liu & Ke Xu. (2019) Minimizing total flow time in two-stage hybrid flowshop with parallel machines and a single batching machine. Minimizing total flow time in two-stage hybrid flowshop with parallel machines and a single batching machine.
Zhao-hong Jia, Xue-xue Zhuo, Joseph Y-T. Leung & Kai Li. (2019) Integrated production and transportation on parallel batch machines to minimize total weighted delivery time. Computers & Operations Research 102, pages 39-51.
Crossref
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
Crossref
Kenneth R. Baker & Dan Trietsch. 2018. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
373
398
.
Hongming Zhou, Jihong Pang, Ping-Kuo Chen & Fuh-Der Chou. (2018) A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes. Computers & Industrial Engineering 123, pages 67-81.
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
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
Yilin Xiao, Qi Tan, Lei Zhou & Hao Tang. (2017) Stochastic scheduling with compatible job families by an improved Q-learning algorithm. Stochastic scheduling with compatible job families by an improved Q-learning algorithm.
Zhao-hong Jia, Yu-lan Zhang, Joseph Y.-T. Leung & Kai Li. (2017) Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines. Applied Soft Computing 55, pages 226-237.
Crossref
Crossref
Shengchao Zhou, Huaping Chen & Xueping Li. (2017) Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times. Applied Soft Computing 52, pages 630-641.
Crossref
Crossref
Nurul Suhaimi, Christine Nguyen & Purushothaman Damodaran. (2016) Lagrangian approach to minimize makespan of non-identical parallel batch processing machines. Computers & Industrial Engineering 101, pages 295-302.
Crossref
Crossref
Shubin Xu & James C. Bean. (2015) Scheduling parallel-machine batch operations to maximize on-time delivery performance. Journal of Scheduling 19:5, pages 583-600.
Crossref
Crossref
Shengchao Zhou, Ming Liu, Huaping Chen & Xueping Li. (2016) An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes. International Journal of Production Economics 179, pages 1-11.
Crossref
Crossref
N. Rafiee Parsa, B. Karimi & S.M. Moattar Husseini. (2016) Minimizing total flow time on a batch processing machine using a hybrid max–min ant system. Computers & Industrial Engineering 99, pages 372-381.
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
Kai Li, Zhao-hong Jia & Joseph Y.-T. Leung. (2015) Integrated production and delivery on parallel batching machines. European Journal of Operational Research 247:3, pages 755-763.
Crossref
Crossref
Zhongya Li, Huaping Chen, Rui Xu & Xueping Li. (2015) Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes. Computers & Industrial Engineering 87, pages 590-599.
Crossref
Crossref
Ran Ma, Long Wan, Lijun Wei & Jinjiang Yuan. (2014) Online bounded-batch scheduling to minimize total weighted completion time on parallel machines. International Journal of Production Economics 156, pages 31-38.
Crossref
Crossref
R. Sahraeian, F. Samaei & I. Rastgar. 2014. Annals of Industrial Engineering 2012. Annals of Industrial Engineering 2012
209
216
.
Shui-Mu Huang & Jack C.P. Su. (2013) Impact of product proliferation on the reverse supply chain. Omega 41:3, pages 626-639.
Crossref
Crossref
B. Q. Fan, T. C. E. Cheng, S. S. Li & Q. Feng. (2012) Bounded parallel-batching scheduling with two competing agents. Journal of Scheduling 16:3, pages 261-271.
Crossref
Crossref
Xin Feng & Feifeng Zheng. 2013. Combinatorial Optimization and Applications. Combinatorial Optimization and Applications
72
83
.
Shuguang Li. (2012) Makespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes. Journal of Software 7:6.
Crossref
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.
Hua Gong & Daheng Chen. (2012) Minimizing the total completion time in a two-machine flowshop with release times. Minimizing the total completion time in a two-machine flowshop with release times.
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
J. Behnamian, S.M.T. Fatemi Ghomi, F. Jolai & O. Amirtaheri. (2012) Realistic two-stage flowshop batch scheduling problems with transportation capacity and times. Applied Mathematical Modelling 36:2, pages 723-735.
Crossref
Crossref
Purushothaman Damodaran & Mario C. Vélez-Gallego. (2012) A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Expert Systems with Applications 39:1, pages 1451-1458.
Crossref
Crossref
A. Bellanger, A. Janiak, M.Y. Kovalyov & A. Oulamara. (2012) Scheduling an unbounded batching machine with job processing time compatibilities. Discrete Applied Mathematics 160:1-2, pages 15-23.
Crossref
Crossref
Daniel Oron. (2011) Scheduling a batching machine with convex resource consumption functions. Information Processing Letters 111:19, pages 962-967.
Crossref
Crossref
Purushothaman Damodaran, Mario C. Vélez-Gallego & Jairo Maya. (2009) A GRASP approach for makespan minimization on parallel batch processing machines. Journal of Intelligent Manufacturing 22:5, pages 767-777.
Crossref
Crossref
Zhan Tao Li, Qing Xin Chen & Ning Mao. (2011) A Heuristics Based on RA for Two-Stage Flexible Flow Shop Scheduling with Head Group Constraint. Applied Mechanics and Materials 101-102, pages 783-789.
Crossref
Crossref
Jianwei Zhang, Baowei Zhang, Zengyu Cai & Zhaoyang Li. 2012. Advanced Intelligent Computing. Advanced Intelligent Computing
612
618
.
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
WEN-WEI WANG, LONG-MIN HE & MING-BAO CHENG. (2011) TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS. Asia-Pacific Journal of Operational Research 27:05, pages 617-627.
Crossref
Crossref
Udo Buscher & Liji Shen. (2010) MIP formulations and heuristics for solving parallel batching problems. Journal of Systems Science and Complexity 23:5, pages 884-895.
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
Payman Jula & Robert C. Leachman. (2010) Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints. Operations Research 58:4-part-1, pages 933-947.
Crossref
Crossref
A. Bellanger, A. Oulamara & M.Y. Kovalyov. (2010) Minimizing total completion time on a batching machine with job processing time compatibilities. Electronic Notes in Discrete Mathematics 36, pages 1295-1302.
Crossref
Crossref
Purushothaman Damodaran & Mario C. Velez-Gallego. (2009) Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times. The International Journal of Advanced Manufacturing Technology 49:9-12, pages 1119-1128.
Crossref
Crossref
Daguang Feng, Peng Liu, Suwen Wu & Bo Liu. (2010) Dynamic programming for single batching machine with total weighted completion time. Dynamic programming for single batching machine with total weighted completion time.
Hui-Mei Wang & Fuh-Der Chou. (2010) Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics. Expert Systems with Applications 37:2, pages 1510-1521.
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.
Lixin Tang & Hua Gong. (2009) The coordination of transportation and batching scheduling. Applied Mathematical Modelling 33:10, pages 3854-3862.
Crossref
Crossref
Daguang Feng & Fengyong Jia. (2009) Cyclic transfer algorithm for single batching machine with total weighted completion time. Cyclic transfer algorithm for single batching machine with total weighted completion time.
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.
JIANFENG REN, YUZHONG ZHANG & GUO SUN. (2011) THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE. Asia-Pacific Journal of Operational Research 26:03, pages 351-363.
Crossref
Crossref
Hua Gong & Lixin Tang. (2009) Production-transportation scheduling model on a single batching machine. Production-transportation scheduling model on a single batching machine.
Kenneth R. Baker & Dan Trietsch. 2009. Principles of Sequencing and Scheduling. Principles of Sequencing and Scheduling
300
324
.
Ali Husseinzadeh Kashan & Behrooz Karimi. (2008) An improved mixed integer linear formulation and lower bounds for minimizing makespan on a flow shop with batch processing machines. The International Journal of Advanced Manufacturing Technology 40:5-6, pages 582-594.
Crossref
Crossref
Lixin Tang & Yufang Zhao. (2008) Scheduling a single semi-continuous batching machine. Omega 36:6, pages 992-1004.
Crossref
Crossref
Rui Xu, Hua-Ping Chen, Jun-Hong Zhu & Hao Shao. (2008) A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes. A Hybrid Ant Colony Optimization to Minimize the Total Completion Time on a Single Batch Processing Machine with Non-identical Job Sizes.
Rui Xu, Hua-Ping Chen, George Q. Huang, Hao Shao, Ba-Yi Cheng & Bo-Wen Liu. (2008) Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization. Minimizing the total completion time on a single batch processing machine with non-identical job sizes using ant colony optimization.
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
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
Fuh-Der Chou. (2006) A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion. The International Journal of Advanced Manufacturing Technology 35:5-6, pages 587-595.
Crossref
Crossref
Lars Mönch & Robert Unbehaun. (2007) Decomposition heuristics for minimizing earliness–tardiness on parallel burn-in ovens with a common due date. Computers & Operations Research 34:11, pages 3380-3396.
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.
Baoqiang Fan, Jianzhong Gu & Guochun Tang. 2007. Algorithmic Aspects in Information and Management. Algorithmic Aspects in Information and Management
91
99
.
SHUGUANG LI, GUOJUN LI & XINGQIN QI. (2011) MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES. International Journal of Foundations of Computer Science 17:06, pages 1441-1453.
Crossref
Crossref
Fuh-Der Chou, Pei-Chann Chang & Hui-Mei Wang. (2005) A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem. The International Journal of Advanced Manufacturing Technology 31:3-4, pages 350-359.
Crossref
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
Crossref
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
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
Lars Mönch, Robert Unbehaun & You In Choung. (2005) Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint. OR Spectrum 28:2, pages 177-198.
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
V.K. Ganesan, A.K. Gupta & S.A. Iyer. (2005) Bi-objective schedule control of batch processes in semiconductor manufacturing. Bi-objective schedule control of batch processes in semiconductor manufacturing.
Pei-Chann Chang, Yun-Shiow Chen & Hui-Mei Wang. 2005. Computational Science and Its Applications – ICCSA 2005. Computational Science and Its Applications – ICCSA 2005
172
181
.
Pei-Chann Chang & Hui-Mei Wang. (2004) A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes. The International Journal of Advanced Manufacturing Technology 24:7-8, pages 615-620.
Crossref
Crossref
CHUNG KEUNG POON & WENCI YU. (2011) ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING. International Journal of Foundations of Computer Science 15:04, pages 593-607.
Crossref
Crossref
José A. Ventura & Daecheol Kim. (2003) Parallel machine scheduling with earliness–tardiness penalties and additional resource constraints. Computers & Operations Research 30:13, pages 1945-1958.
Crossref
Crossref
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
Crossref
Árpád Bakay. 2003. Self-Adaptive Software: Applications. Self-Adaptive Software: Applications
52
65
.
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
R. Cigolini, M. Perona, A. Portioli & T. Zambelli. (2002) A new dynamic look-ahead scheduling procedure for batching machines. Journal of Scheduling 5:2, pages 185-204.
Crossref
Crossref
Nipa Phojanamongkolkij, John W. Fowler & Jeffrey K. Cochran. (2002) Determining operating criterion of batch processing operations for wafer fabrication. Journal of Manufacturing Systems 21:5, pages 363-379.
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
Gouchuan Zhang, Xiaoqiang Cai & C.K. Wong. (2001) On‐line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics (NRL) 48:3, pages 241-258.
Crossref
Crossref
Guochuan Zhang, Xiaoqiang Cai, C.‐Y Lee & C.K Wong. (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Research Logistics (NRL) 48:3, pages 226-240.
Crossref
Crossref
Gregory Dobson & Ramakrishnan S. Nambimadom. (2001) The Batch Loading and Scheduling Problem. Operations Research 49:1, pages 52-65.
Crossref
Crossref
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
Chang Sup Sung, Young Hwan Kim & Sang Hum Yoon. (2000) A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines. European Journal of Operational Research 121:1, pages 179-192.
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
Scott Webster. (2000) Frameworks for adaptable scheduling algorithms. Journal of Scheduling 3:1, pages 21-49.
Crossref
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
Crossref
Xiaotie Deng & Yuzhong Zhang. 1999. Computing and Combinatorics. Computing and Combinatorics
231
240
.
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
Yi-Feng Hung. (1998) Scheduling of mask shop E-beam writers. IEEE Transactions on Semiconductor Manufacturing 11:1, pages 165-172.
Crossref
Crossref
Karl G. Kempf, Reha Uzsoy & Cheng-Shuo Wang. (1998) Scheduling a single batch processing machine with secondary resource constraints. Journal of Manufacturing Systems 17:1, pages 37-51.
Crossref
Crossref
Reha Uzsoy & Yaoyu Yang. (2009) MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON A SINGLE BATCH PROCESSING MACHINE. Production and Operations Management 6:1, pages 57-73.
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
.
Oscar Ciro Lopez, Ricardo M. Barcia & Osama Eyada. (1995) Problema de programação da produção um esquema de classificação. Production 5:2, pages 145-168.
Crossref
Crossref
E. Demirkol, R. Uzsoy & I.M. Ovacik. (1995) Decomposition algorithms for scheduling semiconductor testing facilities. Decomposition algorithms for scheduling semiconductor testing facilities.
Vijaya Chandru, Chung-Yee Lee & Reha Uzsoy. (1993) Minimizing total completion time on a batch processing machine with job families. Operations Research Letters 13:2, pages 61-65.
Crossref
Crossref
C.N. Perry & R. Uzsoy. (1993) Reactive scheduling of a semiconductor testing facility. Reactive scheduling of a semiconductor testing facility.