Parallel machines scheduling with nonsimultaneous machine available time
Discrete Applied Mathematics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Parallel machine scheduling with release time and machine eligibility restrictions
Proceedings of the 21st international conference on Computers and industrial engineering
A note on “parallel machine scheduling with non-simultaneous machine available time”
Discrete Applied Mathematics
Scheduling preemptable tasks on parallel processors with limited availability
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Scheduling in Computer and Manufacturing Systems
Scheduling in Computer and Manufacturing Systems
NP-complete scheduling problems
Journal of Computer and System Sciences
Exponential inapproximability and FPTAS for scheduling with availability constraints
Theoretical Computer Science
Makespan Minimization with Machine Availability Constraints
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Hi-index | 0.01 |
In this paper we consider the problem of scheduling n preemptive jobs on m machines with identical speed under machine availability and eligibility constraints when minimizing maximum lateness (L"m"a"x). The lateness of a job is defined to be its completion time minus its due date, and L"m"a"x is the maximum value of lateness among all jobs. We assume that each machine is not continuously available at all time throughout the planning horizon and each job is only allowed to be processed on specific machines. Network flow technique is used to formulate this scheduling problem into a series of maximum flow problems. We propose a polynomial time two-phase binary search algorithm to verify the feasibility of the problem and to solve the scheduling problem optimally if a feasible schedule exists. Finally, we show that the time complexity of the algorithm is O((n+(2n+2x))^3log(UB-LB)). Most literature in parallel machine scheduling assume that all machines are continuously available for processing and all jobs can be processed at any available machine throughout the planning horizon. But both assumptions might not be true in some practical environment, such as machine preventive maintenance and machines that have different capabilities to process jobs. This type of scheduling problem is seldom studied in the literature. The purpose of this paper is to examine the scheduling problem with machines with identical speed under machine availability and eligibility constraints. The objective is to minimize maximum lateness. We formulate this scheduling problem into a series of maximum flow problems with different values of L"m"a"x. A polynomial time two-phase binary search algorithm is proposed to verify the feasibility of the problem and to determine the optimal L"m"a"x.