×

Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing. (English) Zbl 1349.90287

Summary: Given the mounting concern about service levels and environmental sustainability, mould industry is facing growing pressure to improve delivery reliability and energy efficiency. While heat-treatment operation is a bottleneck that affects related performances in mould manufacturing. Effective production control of this operation is essential to improve the on-time delivery and reduce the energy consumption of the mould. The operation often involves parallel batch processors and incompatible jobs, which allows for simultaneous processing yet with same job family and different weights and due dates. This paper considers the batch process control of parallel processors for dealing with such non-identical jobs in dynamic environments. An event-driven look-ahead batching strategy called MLAB-DE has been proposed. In MLAB-DE, the individual decisions for each family excluding the effects of these decisions on other families are suggested firstly. Then each alternative decision by including its effects on all families is evaluated. MLAB-DE is used to control two kinds of conflicting objectives related to the delivery and energy performances and finally achieve trade-off based on two-level compromise programming model. Simulation study is conducted to verify the effectiveness of the MLAB-DE strategy and show that the results are promising as compared to benchmark rules.

MSC:

90B30 Production models
90B35 Deterministic scheduling theory in operations research

Software:

MAPP
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Liu, J. J.; Chen, Q. X.; Mao, N.; Chen, X. D., Bi-objective dynamic control of batch processor with non-identical jobs in mould manufacturing, Int J Prod Res, 51, 6, 1820-1835 (2013)
[2] Fang, K.; Uhan, N.; Zhao, F.; Sutherland, J. W., A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction, J Manuf Syst, 30, 4, 234-240 (2011)
[3] Stevenson, M., Refining a workload control (WLC) concept: a case study, Int J Prod Res, 44, 4, 767-790 (2006)
[4] Land, M.; Gaalman, G., Production planning and control in SMEs: time for change, Prod Plan Control, 20, 7, 548-558 (2009)
[5] Haapala, K. R.; Rivera, J. L.; Sutherland, J. W., Reducing environmental impacts of steel product manufacturing, Trans North Am Manuf Res Inst SME, 37, 419-426 (2009)
[6] Liu, C. H., Approximate trade-off between minimisation of total weighted tardiness and minimisation of carbon dioxide \((CO_2)\) emissions in bi-criteria batch scheduling problem, Int J Comput Integr Manuf, 27, 8, 759-771 (2014)
[7] Silva, C.; Roque, L.; Almeida, A., MAPP—a web-based decision support system for the mould industry, Decis Support Syst, 42, 2, 999-1014 (2006)
[8] Liu, J. J.; Lin, Z. A.; Chen, Q. X.; Mao, N.; Chen, X. D., A decision support to assign mould due date at customer enquiry stage in computer-integrated manufacturing (CIM) environments, Int J Comput Integr Manuf, 26, 6, 571-582 (2013)
[9] Cerekci, A.; Banerjee, A., Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance, Int J Prod Res, 48, 5, 1339-1359 (2010) · Zbl 1197.90197
[10] Gupta, A. K.; Sivakumar, A. I., Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching, Int J Prod Res, 45, 3, 591-613 (2007) · Zbl 1128.90378
[11] Potts, C. N.; Kovalyov, M. Y., Scheduling with batching: a review, Eur J Oper Res, 120, 2, 228-249 (2000) · Zbl 0953.90028
[12] Mathirajan, M.; Sivakumar, A. I., A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor, Int J Adv Manuf Technol, 29, 9-10, 990-1001 (2006)
[13] Tajan, J. B.C.; Sivakumar, A. I.; Gershwin, S. B., Heuristic control of multiple batch processors with incompatible job families and future job arrivals, Int J Prod Res, 50, 15, 4206-4219 (2012)
[14] Cheng, B. Y.; Cai, J. F.; Yang, S. L.; Hu, X. X., Algorithms for scheduling incompatible job families on single batching machine with limited capacity, Comput Ind Eng, 75, 116-120 (2014)
[15] Gokhale, R.; Mathirajan, M., Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families, Int J Adv Manuf Technol, 70, 1563-1578 (2014)
[16] Xu, R.; Chen, H. P.; Li, X. P., A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system, Int J Prod Econ, 145, 371-386 (2013)
[17] Chiang, T. C.; Cheng, H. C.; Fu, L. C., A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, Comput Oper Res, 37, 12, 2257-2269 (2010) · Zbl 1231.90183
[18] Lu, L. F.; Yuan, J. J., Unbounded parallel batch scheduling with job delivery to minimize makespan, Oper Res Lett, 36, 477-480 (2008) · Zbl 1155.90390
[19] Kashan, A. H.; Karimi, B.; Jenabi, M., A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Comput Oper Res, 35, 1084-1098 (2008) · Zbl 1180.90126
[20] Li, X. L.; Huang, Y. L.; Tan, Q.; Chen, H. P., Scheduling unrelated parallel batch processing machines with non-identical job sizes, Comput Oper Res, 40, 2983-2990 (2013) · Zbl 1348.90285
[21] Li, S. S.; Zhang, Y. Z., Serial batch scheduling on uniform parallel machines to minimize total completion time, Inf Process Lett, 114, 692-695 (2014) · Zbl 1371.90058
[22] Malve, S.; Uzsoy, R., A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families, Comput Oper Res, 34, 3016-3028 (2007) · Zbl 1185.90086
[23] Chen, H. P.; Du, B.; Huang, G. Q., Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals, Int J Comput Integr Manuf, 23, 10, 942-956 (2010)
[24] Balasubramanian, H.; Monch, L.; Fowler, J. W.; Pfund, M. E., Genetic algorithm based scheduling of parallel batch machines with incompatible families to minimize total weighted tardiness, Int J Prod Res, 42, 8, 1621-1638 (2004) · Zbl 1099.90537
[25] Gupta, A. K.; Sivakumar, A. I., Optimization of due-date objectives in scheduling semiconductor batch manufacturing, Mach Tools Manuf, 46, 12-13, 1671-1679 (2006)
[26] Van der Zee, D. J., Dynamic scheduling of batch-processing machines with non-identical product sizes, Int J Prod Res, 45, 10, 2327-2349 (2007) · Zbl 1128.90506
[27] Choi, J.; Realff, M. J.; Lee, J. H., Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application, Comput Chem Eng, 28, 1039-1058 (2004)
[28] Brucker, P.; Gladky, A.; Hoogeveen, J. A.; Kovalyov, M. Y.; Potts, C. N.; Tauteenhahn, T., Scheduling a batching machine, J Sched, 1, 31-54 (1998) · Zbl 0909.90172
[29] Romero, C.; Jones, D. F.; Tamiz, M., Goal programming, compromise programming, and reference-point method formulations: linkages and utility theorems, J Oper Res Soc, 49, 9, 986-991 (1998) · Zbl 1140.90491
[30] Andre, F. J.; Romero, C., Computing compromise solutions: on the connections between compromise programming and composite programming, Appl Math Comput, 195, 1, 1-10 (2008) · Zbl 1169.90440
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.