A mixed integer programming approach for the single machine problem with unequal release dates
From MaRDI portal
Publication:337161
Recommendations
- scientific article; zbMATH DE number 176470
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- scientific article; zbMATH DE number 91757
- Minimizing total tardiness on a single machine with unequal release dates
Cites work
- scientific article; zbMATH DE number 4191384 (Why is no real title available?)
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- A time indexed formulation of non-preemptive single machine scheduling problems
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- An assignment-based lower bound for a class of two-machine flow shop problems
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- 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
- Dominance-based heuristics for one-machine total cost scheduling problems
- Effective heuristics for the single machine sequencing problem with ready times
- Efficient heuristics to minimize total flow time with release dates
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.
- Lower bounds for minimizing total completion time in a two-machine flow shop
- On Scheduling with Ready Times to Minimize Mean Flow Time
- On n/1/?? dynamic deterministic problems
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Revisiting branch and bound search strategies for machine scheduling problems
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
Cited in
(8)- Minimizing total tardiness on a single machine with unequal release dates
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Predictive-reactive strategy for identical parallel machine rescheduling
- An efficient ILP formulation for the single machine scheduling problem
- Large-scale periodic scheduling in time-sensitive networks
- scientific article; zbMATH DE number 176470 (Why is no real title available?)
- Formulating the single machine sequencing problem with release dates as a mixed integer program
This page was built for publication: A mixed integer programming approach for the single machine problem with unequal release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337161)
