A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
From MaRDI portal
Publication:596267
DOI10.1016/S0377-2217(03)00378-3zbMATH Open1056.90054OpenAlexW2051889693MaRDI QIDQ596267FDOQ596267
Philippe Baptiste, Antoine Jouglet, Jacques Carlier
Publication date: 10 August 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00378-3
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Minimizing Total Tardiness on One Machine is NP-Hard
- Ordonnancements à contraintes disjonctives
- Title not available (Why is that?)
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- A decomposition algorithm for the single machine total tardiness problem
- On decomposition of the total tardiness problem
- Title not available (Why is that?)
- Algorithmic paradoxes of the single-machine total tardiness problem
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Solution of the single machine total tardiness problem
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Accelerating filtering techniques for numeric CSPs
- On minimizing total tardiness in a serial batching problem
- Minimizing maximum lateness on one machine: computational experience and some applications
Cited In (25)
- Dominance-based heuristics for one-machine total cost scheduling problems
- Minimizing total tardiness on a single machine with unequal release dates
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- A survey of due-date related single-machine with two-agent scheduling problem
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- A global constraint for total weighted completion time for unary resources
- Heuristic algorithms for a complex parallel machine scheduling problem
- Title not available (Why is that?)
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Scheduling a single machine to minimize a regular objective function under setup constraints
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- Constraint programming approach to a bilevel scheduling problem
- Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- A heuristic algorithm to minimize total weighted tardiness on a single machine with release times
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Recommendations
- Title not available (Why is that?) 👍 👎
- An exact approach to early/tardy scheduling with release dates 👍 👎
- Minimizing total tardiness on a single machine with unequal release dates 👍 👎
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions 👍 👎
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem 👍 👎
This page was built for publication: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596267)
