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-3zbMath1056.90054OpenAlexW2051889693MaRDI QIDQ596267
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)
Related Items
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions, On a resource-constrained scheduling problem with application to distributed systems reconfiguration, A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem, The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, Dominance-based heuristics for one-machine total cost scheduling problems, An investigation on a two-agent single-machine scheduling problem with unequal release dates, A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times, A survey of due-date related single-machine with two-agent scheduling problem, A global constraint for total weighted completion time for unary resources, Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates, New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem, A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time, Constraint programming approach to a bilevel scheduling problem, Minimizing total tardiness on a single machine with unequal 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, 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, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, Scheduling a single machine to minimize a regular objective function under setup constraints, \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, Heuristic algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Solution of the single machine total tardiness problem
- Accelerating filtering techniques for numeric CSPs
- A decomposition algorithm for the single machine total tardiness problem
- On decomposition of the total tardiness problem
- On Minimizing Total Tardiness in a Serial Batching Problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Minimizing maximum lateness on one machine: computational experience and some applications
- Ordonnancements à contraintes disjonctives
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Algorithmic paradoxes of the single-machine total tardiness problem
