Sequencing with due-dates and early start times to minimize maximum tardiness

DOI10.1002/NAV.3800210112zbMath0277.90044OpenAlexW1974776021MaRDI QIDQ4404007

Zaw-Sing Su, Kenneth R. Baker

Publication date: 1974

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

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (24)

Average and worst-case analysis of heuristics for the maximum tardiness problem ⋮ A block approach for single-machine scheduling with release dates and due dates ⋮ Minimal schedulability interval for real-time systems of periodic tasks with offsets ⋮ Scheduling jobs with release dates and tails on identical machines to minimize the makespan ⋮ Scheduling Equal-Length Jobs with Delivery times on Identical Processors ⋮ An effective lower bound on \(L_{\max}\) in a worker-constrained job shop ⋮ An algorithm for single machine sequencing with release dates to minimize maximum cost ⋮ An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints ⋮ New single machine and job-shop scheduling problems with availability constraints ⋮ Developing feasible and optimal schedules of jobs on one machine ⋮ A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times ⋮ The one-machine sequencing problem ⋮ Sensitivity analysis for some scheduling problems ⋮ Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times ⋮ Finding efficient make-to-order production and batch delivery schedules ⋮ Minimizing maximum lateness on one machine: computational experience and some applications ⋮ Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times ⋮ Scheduling of unit-length independent tasks with execution constraints ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Simple algorithms for multiprocessor scheduling to meet deadlines ⋮ Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine ⋮ 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 ⋮ On n/1/?? dynamic deterministic problems

This page was built for publication: Sequencing with due-dates and early start times to minimize maximum tardiness