scientific article; zbMATH DE number 825147

MaRDI QIDQ4858162zbMATH OpenFDO

Authors William Patrick Galvin

Publication date 12 December 1995

zbMATH Keywords

common due-dateminimum penaltysingle machinetotal absolute lateness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling to minimize earliness and number of tardy jobs
• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

Cited in

(8)

• Single-machine scheduling to minimize earliness and number of tardy jobs
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• Single machine scheduling to minimize the number of late jobs under uncertainty.
• Single machine rescheduling for new orders with maximum lateness minimization
• Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date
• Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

This page was built for publication:

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