A note on minimizing maximum lateness in a one-machine sequencing problem with release dates

DOI10.1016/0377-2217(86)90247-XzbMath0577.90039OpenAlexW2088794439MaRDI QIDQ1065705

Eugeniusz Nowicki, Stanisław Zdrzałka

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90247-x

zbMATH Keywords

counterexamplesequencingminimizing maximum latenessone machine with release dates

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A sequencing problem with family setup times ⋮ An algorithm for single machine sequencing with release dates to minimize maximum cost ⋮ Developing feasible and optimal schedules of jobs on one machine ⋮ A procedure for the one-machine sequencing problem with dependent jobs ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ An approximation algorithm for a single-machine scheduling problem with release times and delivery times

Cites Work

• The one-machine sequencing problem
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

This page was built for publication: A note on minimizing maximum lateness in a one-machine sequencing problem with release dates