Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

DOI10.1287/MOOR.21.1.100MaRDI QIDQ4880879zbMATH OpenOpenAlexFDO

Authors Han Hoogeveen

Publication date 23 June 1996

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.21.1.100

zbMATH Keywords

maximum latenessrelease datessingle-machine bicriteria scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Scheduling with target start times
• scientific article; zbMATH DE number 1031383
• Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
• Minimizing The Range Of Lateness On A Single Machine Under Generalized Due Dates
• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time

Cited in

(23)

• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• A new lower bound approach for single-machine multicriteria scheduling
• Earliness-tardiness scheduling problems with a common delivery window
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem
• Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• A metric approach for scheduling problems with minimizing the maximum penalty
• Scheduling a single machine with primary and secondary objectives
• Estimation of absolute error in scheduling problems of minimizing the maximum lateness
• Minimizing the earliness--tardiness costs on a single machine
• Multicriteria scheduling
• Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
• Minimization of the maximal lateness for a single machine
• Minimizing the Range of Lateness on a Single Machine
• Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
• scientific article; zbMATH DE number 1031383 (Why is no real title available?)
• Counting and enumeration complexity with application to multicriteria scheduling
• Scheduling with target start times
• A time-dependent multiple criteria single-machine scheduling problem
• Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
• Fifty years of research in scheduling -- theory and applications
• Jackson's semi-preemptive scheduling on a single machine

This page was built for publication: Minimizing Maximum Promptness and Maximum Lateness on a Single Machine

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