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

DOI10.1016/0377-2217(86)90247-XMaRDI QIDQ1065705zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On lower bounds on the minimum maximum lateness on one machine subject to release date
• A scheme of approximation solution of problem 1 |r j|L max
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• scientific article; zbMATH DE number 4059100
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

Cites work

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

Cited in

(10)

• Minimizing maximum lateness in a flow shop subject to release dates
• On lower bounds on the minimum maximum lateness on one machine subject to release date
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• A sequencing problem with family setup times
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• A procedure for the one-machine sequencing problem with dependent jobs
• A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
• The job shop scheduling problem: Conventional and new solution techniques
• Developing feasible and optimal schedules of jobs on one machine
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065705)