Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

• Published in: European journal of operational research Vol. 179; no. 2; pp. 302 - 315
• Main Authors: Ruiz-Torres, Alex J., López, Francisco J., Ho, Johnny C.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.06.2007; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Dual resource constrained scheduling; Exact sciences and technology; Heuristic; Integer programming; Inventory control, production control. Distribution; Machinery; Number of tardy jobs; Operational research and scientific management; Operational research. Management science; Parallel machines; Production scheduling; Scheduling; Scheduling, sequencing; Studies; Parallel machines; Scheduling; Dual resource constrained scheduling; Number of tardy jobs; Integer programming; Production management; Resource allocation; Heuristic method; Task scheduling; Workload
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2006.03.028

This research investigates the problem of scheduling jobs on a set of parallel machines where the speed of the machines depends on the allocation of a secondary resource. The secondary resource is fixed in quantity and is to be allocated to the machines at the start of the schedule. The scheduling objective is to minimize the number of tardy jobs. Two versions of the problem are analyzed. The first version assumes that the jobs are pre-assigned to the machines, while the second one takes into consideration the task of assigning jobs to the machines. The paper proposes an Integer Programming formulation to solve the first case and a set of heuristics for the second.