Journal ArticleDOI
Bicriteria scheduling problem for unrelated parallel machines
V. Suresh,Dipak Chaudhuri +1 more
TLDR
The results show that the proposed algorithm gives better results both in terms of the quality of solution and execution time than the heuristic proposed earlier.Citations
More filters
Journal ArticleDOI
Unrelated parallel machine scheduling with setup times using simulated annealing
TL;DR: Simulated annealing (SA), a meta-heuristic, is employed in this study to determine a scheduling policy so as to minimize total tardiness, and shows that the proposed SA method significantly outperforms a neighborhood search method in terms of total tardyness.
Journal ArticleDOI
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
TL;DR: This article addresses a multi-stage flow shop scheduling problem with unrelated parallel machines with a simulated annealing (SA)-based heuristic to solve the addressed problem in a reasonable running time.
Journal ArticleDOI
Multi-objective production scheduling: a survey
TL;DR: In this article, the authors provide an extensive review of the literature on the scheduling problems with multiple objectives in the past 13 years and present some problems receiving less attention than the others.
Journal ArticleDOI
Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
TL;DR: Four search heuristics are proposed to address the problem, namely the earliest weighted due date, the shortest weighted processing time, the two-level batch scheduling heuristic, and the simulated annealing method.
Journal ArticleDOI
A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems
TL;DR: This survey reveals that while makespan minimization has been fairly widely studied, problems that include processing characteristics such as release times, sequence dependent setups, and preemptions remain largely unstudied.
References
More filters
Journal ArticleDOI
Tabu Search: A Tutorial
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.
Journal ArticleDOI
Some efficient heuristic methods for the flow shop sequencing problem
TL;DR: In this paper, the best heuristic methods known up to now are compared to solve the flow shop sequencing problem and they improve the complexity of the best one, and a parallel taboo search algorithm is presented and experimental results show that this heuristic allows very good speed-up.
Journal ArticleDOI
A new heuristic method for the flow shop sequencing problem
Marino Widmer,Alain Hertz +1 more
TL;DR: In this paper, a new heuristic method is presented for solving the m -machine, n -job flow shop scheduling problem, which is composed of two phases: the first finds an initial sequence using an analogy with the travelling salesman problem and the second tries to improve this solution using taboo search techniques.
Journal ArticleDOI
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Eugene L. Lawler,J. Labetoulle +1 more
TL;DR: It is shown that no more than O(m 2) preemptions are necessary, in order to schedule n jobs on m unrelated processors so as to minimize makespan.
Journal ArticleDOI
Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
TL;DR: The heuristic solutions are compared with optimal solutions obtained by branch and bound in numerous randomly generated problems and are found to be optimal in most cases.