A note on generalizing the maximum lateness criterion for scheduling

DOI10.1016/0166-218X(93)90087-5MaRDI QIDQ1315993zbMATH OpenFDO

Authors Leslie A. Hall

Publication date 17 March 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(93)90087-5

zbMATH Keywords

maximum lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
• Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
• Scheduling on uniform parallel machines to minimize maximum lateness
• A note on a single machine scheduling problem with generalized total tardiness objective function
• Publication:3478253

Cites work

• `` Strong NP-Completeness Results
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times

Cited in

(4)

• Inverse scheduling with maximum lateness objective
• scientific article; zbMATH DE number 7070855 (Why is no real title available?)
• A note on LPT scheduling
• A scheduling framework for distributed key-value stores and its application to tail latency minimization

This page was built for publication: A note on generalizing the maximum lateness criterion for scheduling

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