An iterative heuristic for the single machine dynamic total completion time scheduling problem
From MaRDI portal
Publication:1919773
DOI10.1016/0305-0548(95)00071-2zbMath0857.90058OpenAlexW1979722828MaRDI QIDQ1919773
Suresh Chand, Rodney Traub, Reha Uzsoy
Publication date: 30 October 1996
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(95)00071-2
Related Items
Dominance-based heuristics for one-machine total cost scheduling problems, A mixed integer programming approach for the single machine problem with unequal 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, Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem, Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Probabilistic Analysis of a Machine Scheduling Problem
- The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- On n/1/?? dynamic deterministic problems
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
