Scheduling a single machine to minimize a regular objective function under setup constraints
From MaRDI portal
Publication:1779690
DOI10.1016/j.disopt.2004.12.003zbMath1140.90390OpenAlexW2160008844MaRDI QIDQ1779690
Philippe Baptiste, Claude le Pape
Publication date: 1 June 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.12.003
Related Items
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, A global constraint for total weighted completion time for unary resources, An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective, Using dual presolving reductions to reformulate cumulative constraints, A survey of scheduling problems with setup times or costs, A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem, On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups, Metaheuristics for a scheduling problem with rejection and tardiness penalties, Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- A survey of algorithms for the single machine total weighted tardiness 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
- Earliness-tardiness scheduling with setup considerations
- A decomposition algorithm for the single machine total tardiness problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- On decomposition of the total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- On Scheduling with Ready Times to Minimize Mean Flow Time
- Technical Note—A Note on the Weighted Tardiness Problem
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- On n/1/?? dynamic deterministic problems
- Minimizing Total Costs in One-Machine Scheduling
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Algorithmic paradoxes of the single-machine total tardiness problem
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
