Citations (26)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (4)
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
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
C S Sung & H C Rim. (2004) Receiver set partitioning and sequencing for multicasting traffic in a WDM lightwave single-hop network. Journal of the Operational Research Society 55:6, pages 630-639.
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
Articles from other publishers (22)
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich & Sven O. Krumke. (2022) Online algorithms to schedule a proportionate flexible flow shop of batching machines. Journal of Scheduling 25:6, pages 643-657.
Crossref
Crossref
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich & Sven O. Krumke. (2020) Scheduling a proportionate flow shop of batching machines. Journal of Scheduling 23:5, pages 575-593.
Crossref
Crossref
Heiner Ackermann, Sandy Heydrich & Christian Weiß. 2020. Operations Research Proceedings 2019. Operations Research Proceedings 2019
591
597
.
Christoph Hertrich. 2020. Operations Research Proceedings 2019. Operations Research Proceedings 2019
27
33
.
Hossein N.Z. Matin, Nasser Salmasi & Omid Shahvari. (2017) Makespan minimization in flowshop batch processing problem with different batch compositions on machines. International Journal of Production Economics 193, pages 832-844.
Crossref
Crossref
Xiu Ping Guo. (2012) A Variable Neighborhood Based Memetic Algorithm for Scheduling Single Batch Processing Machine with Non-Identical Job Sizes. Applied Mechanics and Materials 197, pages 489-495.
Crossref
Crossref
A. Khormali, A. Mirzazadeh & F. Faez. (2011) The openshop batch processing problem with non-identical processing times, using simulated annealing and genetic algorithms approaches. The International Journal of Advanced Manufacturing Technology 59:9-12, pages 1157-1165.
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
Ling-Huey Su & James C. Chen. (2009) Sequencing two-stage flowshop with nonidentical job sizes. The International Journal of Advanced Manufacturing Technology 47:1-4, pages 259-268.
Crossref
Crossref
Praveen Kumar Manjeshwar, Purushothaman Damodaran & Krishnaswami Srihari. (2009) Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing 25:3, pages 667-679.
Crossref
Crossref
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
Purushothaman Damodaran, Praveen Kumar Manjeshwar & Krishnaswami Srihari. (2006) Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms. International Journal of Production Economics 103:2, pages 882-891.
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
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
P. Damodaran & K. Srihari. (2004) Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. Mathematical and Computer Modelling 40:13, pages 1465-1472.
Crossref
Crossref
Sharif Melouk, Purushothaman Damodaran & Ping-Yu Chang. (2004) Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing. International Journal of Production Economics 87:2, pages 141-147.
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
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
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
C.S. Sung & J.I. Min. (2001) Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. European Journal of Operational Research 131:1, pages 95-106.
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