Next Article in Journal
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Next Article in Special Issue
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks
Previous Article in Journal
Estimation of Reliability in a Multicomponent Stress–Strength System for the Exponentiated Moment-Based Exponential Distribution
Previous Article in Special Issue
On Neighborhood Structures and Repair Techniques for Blocking Job Shop Scheduling Problems
Open AccessArticle

Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints

College of Information Technology, University of Bahrain, P.O. Box 32038 Manama, Bahrain
Algorithms 2019, 12(12), 247; https://doi.org/10.3390/a12120247
Received: 7 November 2019 / Revised: 19 November 2019 / Accepted: 19 November 2019 / Published: 21 November 2019
(This article belongs to the Special Issue Exact and Heuristic Scheduling Algorithms)
The problem investigated in this paper is scheduling on uniform parallel machines, taking into account that machines can be periodically unavailable during the planning horizon. The objective is to determine planning for job processing so that the makespan is minimal. The problem is known to be NP-hard. A new quadratic model was developed. Because of the limitation of the aforementioned model in terms of problem sizes, a novel algorithm was developed to tackle big-sized instances. This consists of mainly two phases. The first phase generates schedules using a modified Largest Processing Time ( L P T )-based procedure. Then, theses schedules are subject to further improvement during the second phase. This improvement is obtained by simultaneously applying pairwise job interchanges between machines. The proposed algorithm and the quadratic model were implemented and tested on variously sized problems. Computational results showed that the developed quadratic model could optimally solve small- to medium-sized problem instances. However, the proposed algorithm was able to optimally solve large-sized problems in a reasonable time. View Full-Text
Keywords: uniform parallel machines; unavailability constraints; makespan; quadratic programming; optimal algorithm uniform parallel machines; unavailability constraints; makespan; quadratic programming; optimal algorithm
Show Figures

Figure 1

MDPI and ACS Style

Kaabi, J. Modeling and Solving Scheduling Problem with m Uniform Parallel Machines Subject to Unavailability Constraints. Algorithms 2019, 12, 247.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop