Journal ArticleDOI
A concise survey of scheduling with time-dependent processing times
TLDR
A framework is provided to illustrate how models for this class of machine scheduling problems have been generalized from the classical scheduling theory, and a complexity boundary is presented for each model.About:
This article is published in European Journal of Operational Research.The article was published on 2004-01-01. It has received 603 citations till now. The article focuses on the topics: Rate-monotonic scheduling & Fair-share scheduling.read more
Citations
More filters
Journal ArticleDOI
An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem
TL;DR: In this article, an effective estimation of distribution algorithm (EDA) is proposed to solve the distributed permutation flow shop scheduling problem (DPFSP), where the earliest completion factory rule is employed for the permutation based encoding to generate feasible schedules and calculate the schedule objective value.
Journal ArticleDOI
Single-machine scheduling problems with the effects of learning and deterioration
TL;DR: This paper proves that the WSPT rule and the EDD rule can construct the optimal sequence under some special cases, respectively for the following objective functions: the weighted sum of completion times and the maximum lateness.
Book
Planning Machine Maintenance in Two-machine Shop Scheduling
TL;DR: This work considers the two-machine open shop and two- machine flow shop scheduling problems in which each machine has to be maintained exactly once during the planning period, and the duration of each of these intervals depends on its start time.
Journal ArticleDOI
Optimization of production scheduling with time-dependent and machine-dependent electricity cost for industrial energy efficiency
TL;DR: In this paper, the authors proposed a hybrid genetic algorithm with a blank job insertion algorithm to optimize the weighted sum of two criteria: the makespan of production and the minimization of time-dependent electricity costs.
Journal ArticleDOI
Some scheduling problems with deteriorating jobs and learning effects
TL;DR: A new scheduling model in which both job deterioration and learning exist simultaneously is introduced, and polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time are presented.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Book ChapterDOI
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
TL;DR: In this article, the authors survey the state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory, and indicate some problems for future research and include a selective bibliography.