Efficient heuristics to minimize total flow time with release dates
From MaRDI portal
Publication:1195875
DOI10.1016/0167-6377(92)90092-HzbMath0769.90047WikidataQ57186079 ScholiaQ57186079MaRDI QIDQ1195875
Publication date: 4 January 1993
Published in: Operations Research Letters (Search for Journal in Brave)
heuristicsrelease datestotal flow timeworst-case analysisstrongly NP-hardlocal optimalityone machine scheduling
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A look-ahead heuristic for scheduling jobs with release dates on a single machine ⋮ Scheduling with a position-weighted learning effect and job release dates ⋮ Dominance-based heuristics for one-machine total cost scheduling problems ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ An iterative heuristic for the single machine dynamic total completion time scheduling problem ⋮ Single machine batch scheduling with release times and delivery costs ⋮ Single machine scheduling with release dates: a distributionally robust approach ⋮ Dominance rules in combinatorial optimization problems ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times ⋮ 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 ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem ⋮ Model buidling for air-traffic controllers' workload regulation ⋮ On a scheduling problem of time deteriorating jobs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- 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
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- On n/1/?? dynamic deterministic problems
- On general routing problems
- A Survey of Scheduling Rules
