Journal ArticleDOI
Minimizing maximum tardiness for unrelated parallel machines
V. Suresh,Dipak Chaudhuri +1 more
TLDR
In this article, the scheduling of n jobs, all requiring a single stage of processing, on m unrelated parallel machines is considered, and the scheduling objective is to minimize the maximum tradiness.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
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
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
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.
Journal ArticleDOI
Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints
Jeng-Fung Chen,Tai-Hsi Wu +1 more
TL;DR: An effective heuristic based on threshold-accepting methods, tabu lists, and improvement procedures is proposed to minimize total tardiness and significantly outperforms an ATCS procedure and a simulated annealing method for problems in larger sizes.
References
More filters
Journal ArticleDOI
An Algorithm for the Single-Machine Sequencing Problem to Minimize Total Tardiness
TL;DR: Computational experience indicates that the proposed algorithm is more suitable for microcomputers with limited storage capacity than Schrage and Baker's dynamic programming algorithm.
Journal ArticleDOI
An Algorithm for Minimizing the Range of Lateness on a Single Machine
Ching-Jong Liao,Rong-Hwa Huang +1 more
TL;DR: This paper demonstrates that this problem of minimizing the range of lateness on a single machine can actually be solved in pseudo-polynomial time, and develops such an algorithm.
Journal ArticleDOI
On The Scheduling Of Identical Processors With Entrapment
TL;DR: This paper establishes certain guidelines that can be used as a priori rule deciding the inclusion or exclusion of the entrapment subroutine part of the scheduling algorithm to solve a given problem.
Journal ArticleDOI
Two-level Multilayer Hierarchical Optimization Method for Scheduling Parallel Machines in Manufacturing Systems
Jian-nan Lin,Ying-ping Zheng +1 more
TL;DR: A novel two-level multiplayer hierarchical scheduling algorithm that makes the most of structural properties of the precedence graph of partial ordering task set and introduces the concept of “feasible start time interval” can be used for solving the scheduling problem under study effectively.