On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem

DOI10.1002/nav.3800200106zbMath0256.90027OpenAlexW2162658140MaRDI QIDQ5671775

Pierre N. Robillard, Paul Bratley, Michael Florian

Publication date: 1973

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A block approach for single-machine scheduling with release dates and due dates, Scheduling jobs with release dates and tails on identical machines to minimize the makespan, Scheduling Equal-Length Jobs with Delivery times on Identical Processors, Theoretical expectation versus practical performance of Jackson's heuristic, The one-machine sequencing problem, Surrogate duality relaxation for job shop scheduling, A new approach to computing optimal schedules for the job-shop scheduling problem, Minimizing maximum lateness on one machine: computational experience and some applications, Deterministic job-shop scheduling: Past, present and future, Theoretical and practical issues in single-machine scheduling with two job release and delivery times, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, An approximation algorithm for a single-machine scheduling problem with release times and delivery times