Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
From MaRDI portal
Publication:633558
DOI10.1007/S10951-010-0181-1zbMATH Open1208.90083OpenAlexW2005380783MaRDI QIDQ633558FDOQ633558
Authors: J. M. van den Akker, G. Diepen, Han Hoogeveen 
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
Recommendations
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Single machine scheduling to minimize total weighted tardiness
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling equal-length jobs on identical parallel machines
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Title not available (Why is that?)
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
Cited In (17)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Single machine scheduling with two competing agents and equal job processing times
- Time-indexed formulations and the total weighted tardiness problem
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- Optimal restricted due date assignment in scheduling
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Interweaving real-time jobs with energy harvesting to maximize throughput
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Scheduling a single machine with multiple due dates per job
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
Uses Software
This page was built for publication: Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633558)
