×

Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. (English) Zbl 1168.90655

Summary: This paper investigates the identical parallel machine multiple orders per job (MOJ) scheduling problem to minimise total weighted order completion time, as motivated by 300 mm semiconductor manufacturing operations. Multiple orders per job scheduling is required when multiple customer orders are grouped together in one of a limited number of jobs for simultaneous processing - a challenge as customers measure order-level delivery performance, while manufacturers must schedule at the job level. We investigate two kinds of processing environments, serial and parallel processing, in the presence of non-zero order ready times and sequence-independent setup times between jobs. First, a mixed-integer program is proposed for the scheduling problem. As this problem is NP-Hard, a number of polynomial-time heuristic approaches are proposed. Experimental results identify appropriate heuristic techniques for analysing this practically motivated scheduling problem.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1287/opre.40.4.750 · Zbl 0758.90042 · doi:10.1287/opre.40.4.750
[2] DOI: 10.1080/00207549308956847 · doi:10.1080/00207549308956847
[3] DOI: 10.1287/opre.42.6.1171 · Zbl 0824.90078 · doi:10.1287/opre.42.6.1171
[4] Cheng TCE, IIE Transactions 28 pp 953– (1996) · doi:10.1080/15458830.1996.11770748
[5] DOI: 10.1287/opre.49.1.52.11189 · Zbl 1163.90486 · doi:10.1287/opre.49.1.52.11189
[6] Knutson K, IIE Transactions 31 pp 1103– (1999)
[7] DOI: 10.1287/opre.40.4.764 · Zbl 0759.90046 · doi:10.1287/opre.40.4.764
[8] DOI: 10.1002/jos.102 · Zbl 1009.90045 · doi:10.1002/jos.102
[9] Mason SJ, IIE Transactions (2006)
[10] DOI: 10.1287/opre.37.5.798 · Zbl 0686.90025 · doi:10.1287/opre.37.5.798
[11] DOI: 10.1287/opre.41.5.981 · Zbl 0795.90034 · doi:10.1287/opre.41.5.981
[12] Pinedo M, Scheduling – theory, algorithms, and systems, 2. ed. (2002)
[13] Qu P, Multiple orders per job scheduling problems, Dissertation (PhD) (2004)
[14] DOI: 10.1109/TSM.2005.858503 · doi:10.1109/TSM.2005.858503
[15] DOI: 10.1016/0377-2217(90)90295-M · Zbl 0706.90035 · doi:10.1016/0377-2217(90)90295-M
[16] Tanrisever F, Working paper. Operations Research and Industrial Engineering Program (2004)
[17] DOI: 10.1080/07408179208964233 · doi:10.1080/07408179208964233
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.