Scheduling unrelated parallel machines to minimize total weighted tardiness

Authors:
Ching-Fang Liaw;Yang-Kuei Lin;Chun-Yuan Cheng;Mingchin Chen
Affiliations:
Department of Industrial Engineering and Management, Chaoyang University of Technology, Taichung, Taiwan;Department of Industrial Engineering and Management, Chaoyang University of Technology, Taichung, Taiwan;Department of Industrial Engineering and Management, Chaoyang University of Technology, Taichung, Taiwan;Department of Industrial Engineering and Management, Chaoyang University of Technology, Taichung, Taiwan
Venue:
Computers and Operations Research
Year:
2003

Citing 3
Cited 19

A note on the weighted tardiness problem

Operations Research
Scheduling parallel machines to minimize total weighted and unweighted tardiness

Computers and Operations Research
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM

Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Computers and Operations Research
Minimizing the total weighted completion time on unrelated parallel machines with stochastic times

WSC '05 Proceedings of the 37th conference on Winter simulation
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

Computers and Operations Research
Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering set-up times

International Journal of Computer Applications in Technology
Short Communication: Generating subproblems in branch and bound algorithms for parallel machines scheduling problem

Computers and Industrial Engineering
A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times

Computers and Operations Research
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates

Computers and Operations Research
Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints

Computers and Operations Research
Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning

Computers and Operations Research
An optimal procedure for minimizing total weighted resource tardiness penalty costs in the resource-constrained project scheduling problem

Computers and Industrial Engineering
Sequence-dependent group scheduling problem on unrelated-parallel machines

Expert Systems with Applications: An International Journal
A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines

Journal of Intelligent Manufacturing
Makespan minimization for scheduling unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This article considers the problem of scheduling a given set of independent jobs on unrelated parallel machines to minimize the total weighted tardiness. The problem is known to be NP-hard in the strong sense. Efficient lower and upper bounds are developed. The lower bound is based on the solution of an assignment problem, while the upper bound is obtained by a two-phase heuristic. A branch-and-bound algorithm that incorporates various dominance rules is presented. Computational experiments are conducted to demonstrate the performance of the proposed algorithm.