On n/1/?? dynamic deterministic problems

DOI10.1002/nav.3800260315zbMath0496.90044OpenAlexW2002997223MaRDI QIDQ3960456

Ramesh Chandra

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260315

zbMATH Keywords

single machinebranch and bound algorithmcomputational experienceminimization of mean flow timesequencing of n jobswith pre-emptionwithout pre-emption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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 scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ 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 ⋮ Efficient heuristics to minimize total flow time with release dates ⋮ 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 ⋮ On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems

Cites Work

• Sequencing with due-dates and early start times to minimize maximum tardiness
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline