Scheduling unrelated parallel machines to minimize total weighted tardiness.
From MaRDI portal
Publication:1413838
DOI10.1016/S0305-0548(02)00105-3zbMath1047.90021OpenAlexW2077473653MaRDI QIDQ1413838
Ching-Fang Liaw, Mingchin Chen, Chun-Yuan Cheng, Yang-Kuei Lin
Publication date: 17 November 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00105-3
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (26)
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ Parallel machine selection and job scheduling to minimize machine cost and job tardiness ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops ⋮ Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Scheduling unrelated parallel machines with sequence-dependent setups ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization ⋮ An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints ⋮ Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Order assignment and scheduling under processing and distribution time uncertainty ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Technical Note—A Note on the Weighted Tardiness Problem
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- Scheduling independent tasks to reduce mean finishing time
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: Scheduling unrelated parallel machines to minimize total weighted tardiness.
