Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs

DOI10.1007/s10951-010-0181-1zbMath1208.90083MaRDI QIDQ633558

G. Diepen, J. M. van den Akker, Hoogeveen, J. A.

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-010-0181-1

zbMATH Keywords

weighted tardiness; common processing time; time indexed formulation

Mathematics Subject Classification ID

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

Related Items

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Exact algorithms for single-machine scheduling with time windows and precedence constraints, Single machine scheduling with two competing agents and equal job processing times, Optimal restricted due date assignment in scheduling, A survey of single machine scheduling to minimize weighted number of tardy jobs, Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness, Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates, Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling equal-length jobs on identical parallel machines
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A new dominance rule to minimize total weighted tardiness with unequal release dates.