On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness

DOI10.1287/opre.23.3.475zbMath0301.90024OpenAlexW2171210634MaRDI QIDQ4055376

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.3.475

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

A branch and bound algorithm for the job-shop scheduling problem, 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, Adjustment of heads and tails for the job-shop problem, 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, 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, A procedure for the one-machine sequencing problem with dependent jobs, An 11/7 — Approximation Algorithm for Single Machine Scheduling Problem with Release and Delivery Times, Scheduling Algorithms for Single Machine Problem with Release and Delivery Times, A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates, Scheduling on parallel identical machines with late work criterion: offline and online cases, Scheduling of project networks, Surrogate duality relaxation for job shop scheduling, Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan, On optimal lateness and tardiness scheduling in real-time systems, Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times, Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times, Fuzzy job-shop scheduling problems: a review, One-machine rescheduling heuristics with efficiency and stability as criteria, A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups, Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times, A game-theoretic control approach for job shops in the presence of disruptions, A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates, Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints, Jackson's semi-preemptive scheduling on a single machine, Minimizing maximum tardiness and delivery costs with batch delivery and job release times, A modified shifting bottleneck procedure for job-shop scheduling, Deterministic job-shop scheduling: Past, present and future, Extending the shifting bottleneck procedure to real-life applications, The job shop scheduling problem: Conventional and new solution techniques, Scheduling a single machine with primary and secondary objectives, Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem, Flowshop scheduling with identical jobs and uniform parallel machines, An approximation algorithm for a single-machine scheduling problem with release times and delivery times, Concurrent operations can be parallelized in scheduling multiprocessor job shop