Optimal assignment of due-dates for preemptive single-machine scheduling

DOI10.1016/0895-7177(94)90204-6MaRDI QIDQ1341396zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, V. S. Gordon

Publication date 11 January 1995

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://digital.library.unt.edu/ark:/67531/metadc1386324/

zbMATH Keywords

precedence constraintsdue-date assignmentpreemptive schedulingsingle-machine shopmaximum tardiness penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A note on optimal assignment of slack due-dates in single-machine scheduling
• Optimal due-date assignment and sequencing
• Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• Optimal due-date assignment and sequencing in a single machine shop

Cites work

• scientific article; zbMATH DE number 3825547 (Why is no real title available?)
• scientific article; zbMATH DE number 3825682 (Why is no real title available?)
• A simpler and faster algorithm for optimal total-work-content-power due data determination
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Due Date Assignment for Production Systems
• Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Optimal TWK-power due-date determination and sequencing
• Optimal assignment of slack due-dates and sequencing in a single-machine shop
• Optimal constant due-date assignment and sequencing
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
• Survey of scheduling research involving due date determination decisions

Cited in

(9)

• Scheduling problems with partially ordered jobs
• The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
• A simpler and faster algorithm for optimal total-work-content-power due data determination
• Single-machine scheduling with waiting-time-dependent due dates
• Single-machine multitasking scheduling with job efficiency promotion
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• A note on optimal assignment of slack due-dates in single-machine scheduling
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Scheduling with due date assignment under special conditions on job processing

This page was built for publication: Optimal assignment of due-dates for preemptive single-machine scheduling

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