Scheduling a single machine to minimize a regular objective function under setup constraints
From MaRDI portal
Recommendations
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- A single-machine bicriterion scheduling problem with setup times
- Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
- Lower bounds for tardiness minimization on a single machine with family setup times
- scientific article; zbMATH DE number 10435
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- A decomposition algorithm for the single machine total tardiness problem
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Accelerating filtering techniques for numeric CSPs
- Algorithmic paradoxes of the single-machine total tardiness problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Earliness-tardiness scheduling with setup considerations
- Efficient heuristics to minimize total flow time with release dates
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Minimizing Total Costs in One-Machine Scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- On Scheduling with Ready Times to Minimize Mean Flow Time
- On decomposition of the total tardiness problem
- On n/1/?? dynamic deterministic problems
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
- Solution of the single machine total tardiness problem
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Technical Note—A Note on the Weighted Tardiness Problem
Cited in
(17)- Metaheuristics for a scheduling problem with rejection and tardiness penalties
- A single-machine bicriterion scheduling problem with setup times
- Minimizing the makespan on a single machine subject to modular setups
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- 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
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A survey of scheduling problems with setup times or costs
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- Using dual presolving reductions to reformulate cumulative constraints
- Minimizing the number of machines for minimum length schedules
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This page was built for publication: Scheduling a single machine to minimize a regular objective function under setup constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779690)
