Journal ArticleDOI
Scheduling of unrelated parallel machines when machine availability is specified
V. Suresh,Dipak Ghaudhuri +1 more
Reads0
Chats0
TLDR
This paper considers the problem of scheduling jobs on unrelated parallel machines when machine holidays are specified, and two cases are considered, first, when the machine vacations are known apriori, and the second, when these constraints are not known Apriori.Citations
More filters
Journal ArticleDOI
A survey of scheduling with deterministic machine availability constraints
TL;DR: In this paper, a survey of deterministic scheduling problems with availability constraints motivated by preventive maintenance is presented, where complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are surveyed briefly.
Journal ArticleDOI
Integrated models in production planning and scheduling, maintenance and quality: a review
TL;DR: In this article, the authors present a review of the literature on interrelated and integrated models of production planning, scheduling, maintenance and quality, and identify possible future directions to improve operational cost and improved efficiency for any production system.
Journal ArticleDOI
Scheduling unrelated parallel machines with sequence-dependent setups
TL;DR: A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented and the use of a specific search algorithm led to identifying solutions of better quality or that required lower computation time, but not both.
Journal ArticleDOI
Unrelated parallel machine scheduling with job splitting
Rasaratnam Logendran,Fenny Subur +1 more
TL;DR: The results show that the newly developed composite dispatching heuristic, referred to as the modified apparent tardiness cost, is capable of obtaining initial solutions that significantly accelerate the tabu-search-based heuristics to attain the best solution.
Journal ArticleDOI
Multi-machine scheduling with deteriorating jobs and scheduled maintenance
Wen-Chiung Lee,Chin-Chia Wu +1 more
TL;DR: A multi-machine scheduling problem in which job processing times are increasing functions of their starting times and machines are not always available is investigated, and a lower bound and a heuristic algorithm are derived for each case.
References
More filters
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Journal ArticleDOI
Approximation algorithms for scheduling unrelated parallel machines
TL;DR: It is proved that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP, and a complexity classification for all special cases with a fixed number of processing times is obtained.
Journal ArticleDOI
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Oscar H. Ibarra,Chul E. Kim +1 more
TL;DR: A simplified scheduling problem involving identical processors and restricted task sets is shown to be P-complete, however, the LPT algorithm applied to this problem yields schedules which are near optimal for large n .
Journal ArticleDOI
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Ellis Horowitz,Sartaj Sahni +1 more
TL;DR: Exact and approximate algorithms are presented for scheduling independent tasks in a multiprocessor environment in which the processors have different speeds and are guaranteed to obtain solutions that are close to the optimal.
Journal ArticleDOI
Technical Note-Minimizing Average Flow Time with Parallel Machines
TL;DR: The assignment and sequencing of single-operation jobs in a parallel-machine environment can be formulated as an assignment problem and means for reducing the size and computational difficulty of this problem are identified.