Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
From MaRDI portal
(Redirected from Publication:633558)
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
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Minimizing Total Tardiness on One Machine is NP-Hard
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Scheduling equal-length jobs on identical parallel machines
- Single-machine scheduling of unit-time jobs with earliness and tardiness penalties
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
Cited in
(18)- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- 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
- Scheduling a single machine with multiple due dates per job
- Interweaving real-time jobs with energy harvesting to maximize throughput
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Single machine scheduling with two competing agents and equal job processing times
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Exact algorithms for single-machine scheduling with time windows and precedence constraints
- Exact approaches for single machine total weighted tardiness batch scheduling
- Time-indexed formulations and the total weighted tardiness problem
- Optimal restricted due date assignment in scheduling
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
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)
