Journal ArticleDOI
Minimizing maximum tardiness for unrelated parallel machines
V. Suresh,Dipak Chaudhuri +1 more
Reads0
Chats0
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
Minimizing the average deviation of job completion times about a common due date
TL;DR: In this article, a single-machine scheduling problem in which penalities occur when a job is completed early or late is considered, where the objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions.
Journal ArticleDOI
One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
TL;DR: It proves theorems that establish the relative order in which pairs of jobs are processed in an optimal schedule; frequently they permit the jobs to be completely ordered, thus solving the problem without any searching.
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
The single machine early/tardy problem
Peng Si Ow,Thomas E. Morton +1 more
TL;DR: A variation of the Beam Search method, called Filtered Beam Search, is proposed, able to use priority functions to search a number of solution paths in parallel and was not only efficient but also consistent in providing near-optimal solutions with a relatively small search tree.
Book ChapterDOI
Preemptive scheduling of uniform machines subject to release dates
TL;DR: In this paper, two polynomial-time algorithms are presented to find optimal preemptive schedules on parallel machines, subject to release dates for the jobs, for minimizing total weighted completion time on a single machine.