Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine

DOI10.1023/A:1018987625819zbMATH Open0922.90092OpenAlexW282106005MaRDI QIDQ1290164FDOQ1290164

Milan Vlach, Keisuke Tanaka

Publication date: 10 June 1999

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

Full work available at URL: https://doi.org/10.1023/a:1018987625819

Recommendations

• Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• scientific article
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

zbMATH Keywords

single machinegeneralized due datesmaximum absolute latenessrange of lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (17)

• Two-agent single-machine scheduling with assignable due dates
• An Algorithm for Minimizing the Range of Lateness on a Single Machine
• A greedy heuristic for solving scheduling problems with bounded rejection cost
• A single machine scheduling with generalized and periodic due dates to minimize total deviation
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
• Improved Bounds for the Range of Lateness on a Single Machine
• Batch scheduling of deteriorating reworkables
• Minimizing total late work on a single machine with generalized due-dates
• Order acceptance and scheduling with delivery under generalized parameters
• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
• Single machine scheduling with rejection and generalized parameters
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
• A note on generalizing the maximum lateness criterion for scheduling
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
• Single machine scheduling with assignable due dates
• The quadratic balanced optimization problem
• Title not available (Why is that?)

This page was built for publication: Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine

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