Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Introduction
We consider the problem of scheduling preemptive jobs on machines with identical speed under machine availability and eligibility constraints. The objective is to minimize the maximum lateness . Machine availability constraint means that each machine is available for processing only in some intervals of time called availability intervals. In practice, such availability intervals may appear in machine preventive maintenance [1], [2], multitasking computer systems [3], [4], [5], [6] and the case where machines may be partially occupied by a specific set of jobs that must be scheduled at particular time intervals due to various inevitable reasons. Eligibility constraint means that each machine may have the different capability to process jobs; in other words, each job should be processed on specific machines. The application of such an eligibility constraint setting can be found in the semiconductor manufacturing environment [7], [8] and service industry [9].
Minimization of the maximum lateness, , is the objective considered in this paper. is important for the cases where the impact of a single large delay is more harmful to a manufacturer than many small delays. In addition, may be used as an aid for solving other problems. For example, minimizing the maximum flow time can be obtained by setting the due date equal to the release time and then minimizing .
Below we review the related research on the parallel machine scheduling with machine availability or eligibility constraint. Ullman [10] was the first to address the scheduling problem with the availability constraint from the complexity point of view. Ullman proved the strong NP-completeness of the problem while considering the precedence constraint on an arbitrary number of identical machines. Schmidt [2] investigated the preemptive scheduling problem where each job has a deadline and each machine has different availability. He presented an time algorithm for finding a feasible preemptive schedule whenever one exists. Blazewicz et al. [3] analyzed several preemptive scheduling problems where availability is assumed as staircase pattern and jobs have precedence constraints. Later, Blazewicz et al. [4] considered multiprocessor scheduling problems that are subject to the machine availability constraint and proposed polynomial time algorithms to solve the problems. For non-preemption scheduling, parallel machine problems with availability constraints have been studied in Hwang and Chang [11], Kellerer [12], Lee [13], Lee [14], Lee et al. [15], etc., in which heuristic algorithms were proposed and the worse-case ratios were provided. Comprehensive surveys in this area we refer the readers to Liu and Sanlaville [16] and Schmidt [6].
For the problem with the eligibility constraint, Pinedo [17] stated that the least flexible job first (LFJ) rule, which first selects the job that can be processed on the smallest number of machines, is optimal for the problem when the sets are nested, where denotes the set of machines that can process job . Centeno and Armacost [7] investigated problem when due dates are equal to release date plus a constant. The authors first developed a heuristic algorithm based on LFJ rule for the problem, and then they developed few heuristic algorithms for problem and showed that the LPT rule is superior to the LFJ rule in performance when the machine eligibility sets are not nested [8]. Lin and Li [18] considered the problems where jobs have unit process times. They developed polynomial time algorithms for the problem , , , and the problem where the subsets of is convex. Hwang et al. [9] investigated the problem where all jobs and machines are specified by service grades, namely a job can only be processed on a machine with a service grade less than the job's service grade. They proposed LPT-based algorithm with a tight bound.
We observe that the foregoing published works did not consider machine availability and eligibility constraints simultaneously. Almost all of those studies dealing with the machine scheduling with availability and eligibility constraints developed LPT- or LFJ-based heuristic algorithm for solving the problems. In this paper, we consider a more practical situation where each machine has arbitrary availability intervals within the planning horizon and each job requires a specific subset of machines for processing.
Based on the well-known three-field, , classification scheme suggested in Pinedo [17], our scheduling issue can be classified as the problem , , . in the field denotes the arbitrary pattern of availability intervals of machines, and in the field denotes a specific subset of machines that can process job . In this scheduling problem, we extend the network flow technique used in [3], [19], [20], [21] to formulate the problem into a series of maximum network problems. We propose a two-phase binary search algorithm to determine the optimal by solving these maximum network problems or to determine the infeasibility of the problem.
The rest of the paper is organized as follows. In Section 2 we define the notations used. In Section 3 we present the two-phase binary search algorithm for the problem. We address the conclusions in Section 4.
Section snippets
Notations
Index set the direct arc set of the network the machine index the job index the availability interval index the distinct time epoch index the job node set of the event interval node set of the source of the sink of the critical value index Parameters the th availability interval on machine , where and are the start time and the end time of this availability interval, respectively, the distinct time epoch, the event epoch set the total number of
Network flow model for problem
Given a planning horizon, there are preemptive jobs to be scheduled on machines. Each job , , associates with a release time , an processing time and a due date . Job can only be processed on a specific subset of machines, . Each machine , is only available for processing within each of specified availability intervals throughout the planning horizon . Without loss of generality, we assume that for ;
Conclusion
In this paper, we have analyzed the scheduling problem for machines with identical speed under machine availability and eligibility constraints, while minimizing maximum lateness. The problem arises in the environment where a job requires to be processed on specific machines and machines are not continuously available. This research is the first to consider machine availability and eligibility constraints simultaneously in parallel machine scheduling. We formulate the base problem with respect
Acknowledgements
The authors express their gratitude to an anonymous referee for his/her detailed comments and valuable suggestions to improve the exposition of this paper. This research was supported in part by the National Science Council under Grant NSC 90-2218-E-008-002.
References (24)
- et al.
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing
(2000) - et al.
Scheduling multiprocessor tasks on parallel processors with limited availability
European Journal of Operational Research
(2003) Scheduling with limited machine availability
European Journal of Operational Research
(2000)- et al.
Parallel machine scheduling with release time and machine eligibility restrictions
Computers & Industrial Engineering
(1997) - et al.
Parallel machine scheduling under a grade of service provision
Computer & Operations Research
(2004) NP-complete scheduling problems
Journal of Computer and System Sciences
(1975)- et al.
Parallel machines scheduling with machine shutdowns
Computers & Mathematics with Applications
(1998) Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
(1991)- et al.
A note on “parallel machine scheduling with non-simultaneous machine available time”
Discrete Applied Mathematics
(2000) - et al.
Parallel machine scheduling of machine-dependent jobs with unit-length
European Journal of Operational Research
(2004)
Preemptive scheduling of uniform machines subject to release dates
Scheduling in computer and manufacturing system
Cited by (15)
A hybrid algorithm for order acceptance and scheduling problem in make-to-stock/make-to-order industries
2019, Computers and Industrial EngineeringCitation Excerpt :The information of cloud orders is deterministic. We intend to insert cloud orders into the idle time intervals of the existing schedule of regular orders which can be treated as machine availability constraints (MAC) (Sheen & Liao, 2007) to cloud orders. The idle time interval in the existing schedule is named as available time interval (ATI) for cloud orders.
The battery switching station scheduling problem
2012, Operations Research LettersCitation Excerpt :The BSSSP is closely related to previously studied scheduling problems of parallel machines with preemption, release times and due dates. See for example Lawler and Labetoulle [4], Gonzalez and Sahni [2], Federgruen and Groenevelt [1], and Sheen and Liao [8]. There are four differing points between the BSSSP and the above-mentioned scheduling problem: (1) Jobs are released upon the due date of previous ones (a closed loop system); (2) Jobs are allowed to be partially completed in return for some penalty proportional to the fraction of the job that was not completed; (3) The processing costs vary over time; (4) The capacity of the system (number of parallel machines that are available) varies over time.
A fast heuristic for a lot splitting and scheduling problem of a Textile industry
2010, IFAC Proceedings Volumes (IFAC-PapersOnline)Exponential inapproximability and FPTAS for scheduling with availability constraints
2009, Theoretical Computer ScienceScheduling with processing set restrictions: A survey
2008, International Journal of Production EconomicsA branch and bound algorithm for optimal television commercial scheduling
2022, Mathematical Biosciences and Engineering