Abstract
This study addresses the two-machine flowshop in which a batch processor is followed by a discrete processor. The batch machine processes a batch of jobs simultaneously and the discrete machine processes one job at a time. Each job has a certain size or capacity requirements. The capacity of the batch processor is limited. The objective is to minimize the makespan. This problem is shown to be nondeterministic polynomial time hard. A heuristic algorithm and a branch-and-bound algorithm are presented. Computational results show that the proposed heuristic algorithm works effectively compared to the optimal solution, with an overall average quality of 99.42%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahmadi JH, Ahmadi RH, Dasu S, Tang CS (1992) Batching and scheduling jobs on batch and discrete processors. Oper Res 39(4):750–763
Cheng TCE, Wang G (1998) Batching and scheduling to minimize the makespan in the two-machine flow shop. IIE Trans 30(5):447–453
Sung CS, Yoon SH (1997) Minimizing maximum completion time in a two-batch-processing-machine flowshop with dynamic arrivals allowed. Eng Opt 28:231–243
Sung CS, Kim YH (2002) Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Comput Oper Res 29(3):275–294
Sung CS, Kim YH (2003) Minimizing due date related performance measures on two batch processing machines. Eur J Oper Res 147(3):644–656
Pranzo M (2004) Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. Eur J Oper Res 153(3):581–592
Su LH (2003) A hybrid two-stage flowshop with limited waiting time constraints. Comput Ind Eng 44(3):409–424
Allahverdi A, AI-Anzi FS (2008) The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 37:166–177
Tavakkoli-Moghaddam R, Rahimi-Vahed AR (2008) Solving a multi-objective no-wait flowshop scheduling problem with an immune algorithm. Int J Adv Manuf Technol 36:969–981
Chang PC, Wang HM (2004) A heuristic for a batch processing machine scheduled to minimize total completion time with non-identical job sizes. Int J Adv Manuf Technol 24:615–620
Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32:1615–1635
Dupont L, Dhaenens-Flipo C (2002) Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure. Comput Oper Res 29(7):807–819
Jolai GF, Dupont L (1998) Minimizing mean flow times criteria on a single batch processing machine with non-identical job sizes. Int J Prod Econ 55(3):273–280
Mathirajan M, Sivakumar AI (2006) Minimizing total weighted tardiness on heterogeneous batch processing machines with incompatible job families. Int J Adv Manuf Technol 28:1038–1047
Gupta JND, Ho JC (1999) A new heuristic algorithm for the one-dimensional bin-packing problem. Prod Plan Cont 10(6):598–603
Johnson SM (1954) Optimal two and three-stage production schedule with setup times included. Nav Res Log Quart 1:61–68
Fleszar K, Hindi KS (2002) New heuristics for one-dimensional bin-packing. Comput Oper Res 29(7):821–839
Scholl A, Klein R, Jurgens C (1997) BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Comput Oper Res 24(7):627–645
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Su, LH., Chen, J.C. Sequencing two-stage flowshop with nonidentical job sizes. Int J Adv Manuf Technol 47, 259–268 (2010). https://doi.org/10.1007/s00170-009-2192-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-009-2192-7