A mixed integer programming approach for the single machine problem with unequal release dates
From MaRDI portal
Publication:337161
DOI10.1016/j.cor.2014.06.013zbMath1348.90281OpenAlexW2091335185MaRDI QIDQ337161
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.06.013
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An assignment-based lower bound for a class of two-machine flow shop problems
- Lower bounds for minimizing total completion time in a two-machine flow shop
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- A time indexed formulation of non-preemptive single machine scheduling problems
- Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates
- Improving the preemptive bound for the one-machine dynamic total completion time 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
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- Dominance-based heuristics for one-machine total cost scheduling problems
- Revisiting branch and bound search strategies for machine scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Effective heuristics for the single machine sequencing problem with ready times
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- On Scheduling with Ready Times to Minimize Mean Flow Time
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- On n/1/?? dynamic deterministic problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
This page was built for publication: A mixed integer programming approach for the single machine problem with unequal release dates
