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.
About: This article is published in Computers & Operations Research.The article was published on 2007-11-01. It has received 118 citations till now. The article focuses on the topics: Tabu search & Search algorithm.
Citations
More filters
Journal Article•
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON
13,333 citations
TL;DR: This paper is the third comprehensive survey paper which provides an extensive review of about 500 papers that have appeared since the mid-2006 to the end of 2014, including static, dynamic, deterministic, and stochastic environments, based on shop environments as single machine, parallel machine, flowshop, job shop, or open shop.
369 citations
TL;DR: After an exhaustive computational and statistical analysis it can be concluded that the proposed method shows an excellent performance overcoming the rest of the evaluated methods in a comprehensive benchmark set of instances.
335 citations
Cites methods from "Scheduling unrelated parallel machi..."
...A tabu search algorithm is given in Logendran et al. (2007) for the weighted tardiness objective....
[...]
TL;DR: An Ant Colony Optimization algorithm is introduced and is applied to this NP-hard problem with machine-dependent and sequence-dependent setup times and the results show that ACO outperformed the other algorithms.
Abstract: This paper addresses the non-preemptive unrelated parallel machine scheduling problem with machine-dependent and sequence-dependent setup times. All jobs are available at time zero, all times are deterministic, and the objective is to minimize the makespan. An Ant Colony Optimization (ACO) algorithm is introduced in this paper and is applied to this NP-hard problem; in particular, the proposed ACO tackles a special structure of the problem, where the ratio of the number of jobs to the number of machines is large (i.e., for a highly utilized set of machines). Its performance is evaluated by comparing its solutions to solutions obtained using Tabu Search and other existing heuristics for the same problem, namely the Partitioning Heuristic and Meta-RaPS. The results show that ACO outperformed the other algorithms.
137 citations
Cites methods from "Scheduling unrelated parallel machi..."
...Finally, Logendran et al. (2007) developed six different Tabu Search-based algorithms to identify the best schedule that gives the minimum weighted tardiness....
[...]
References
More filters
Journal Article•
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON
13,333 citations
"Scheduling unrelated parallel machi..." refers background in this paper
...DMI-0010118....
[...]
...• Read problem inputs in from file: number of jobs (J), number of machines (M), runtimes for each job on each processible machine, sequence-dependent setup times for each job on each processible machine, due dates, weights, and release times for each job, and initial availability times for each…...
[...]
...If short-term memory, do not loop (zero restarts, one time total through algorithm)....
[...]
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Abstract: We survey and extend the results on the complexity of machine scheduling problems. After a brief review of the central concept of NP-completeness we give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity. The problems for which a polynomial-bounded algorithm is available are listed and NP-completeness is established for a large number of other machine scheduling problems. We finally discuss some questions that remain unanswered.
1,881 citations
TL;DR: This paper presents tabu search, a heuristic procedure designed to guide other methods to escape the trap of local optimality, which has obtained optimal and near optimal solutions to a wide variety of classical and practical problems.
Abstract: Tabu search is a “higher level” heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and practical problems in applications ranging from scheduling to telecommunications and from character recognition to neural networks. It uses flexible structures memory (to permit search information to be exploited more thoroughly than by rigid memory systems or memoryless systems), conditions for strategically constraining and freeing the search process (embodied in tabu restrictions and aspiration criteria), and memory functions of varying time spans for intensifying and diversifying the search (reinforcing attributes historically found good and driving the search into new regions). Tabu search can be integrated with branch-and-bound and cutting plane procedures, and it has the ability to start with a simple implementation th...
1,040 citations
"Scheduling unrelated parallel machi..." refers background in this paper
...Recent work by Bilge et al. [22] has relaxed one of these assumptions to consider an unrelated parallel machine scheduling problem wherein jobs are released at various times during the planning horizon, a feature referred to as dynamic job releases....
[...]
TL;DR: The results indicate that the new rules are not only superior to competing rules for minimizing weighted tardiness penalties but are also robust for several other criteria, such as the number of tardy jobs and the costs of in-process inventories.
Abstract: Mainstream research in priority dispatching has considered jobs with equal delay penalties, thereby ruling out strategic differentiation of customer orders. We develop and test efficient dispatchin...
535 citations
"Scheduling unrelated parallel machi..." refers background in this paper
...Industrial scheduling has greatly benefited from the use of unrelated parallel machines due to their ability to perform the same function but with varying capability or capacity....
[...]
TL;DR: The major research results in deterministic parallel-machine scheduling theory will pass a survey and it is revealed that there exist a lot of potential areas worthy of further research.
499 citations
"Scheduling unrelated parallel machi..." refers background or methods in this paper
...Thus, it can be swapped with J5 scheduled on the same machine (M32) and J4 scheduled on M31 to create two new schedules....
[...]
...Similar explanations hold true for identifying the initial solutions with three other IS heuristics (IS1: EDD; IS2: TWT, and IS4: HCR)....
[...]
...Recognizing the inherent difficulty in solving industrial-size problems efficiently, six different search algorithms based on tabu search are developed to identify the best schedule that gives the minimum weighted tardiness....
[...]