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

DOI10.1016/0895-7177(94)90204-6zbMath0810.90064OpenAlexW1583610288MaRDI QIDQ1341396

Valery S. Gordon, Cheng, T. C. Edwin

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 constraintspreemptive schedulingdue-date assignmentsingle-machine shopmaximum tardiness penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

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, Scheduling problems with partially ordered jobs, Scheduling with due date assignment under special conditions on job processing

Cites Work

• Unnamed Item
• Unnamed Item
• A simpler and faster algorithm for optimal total-work-content-power due data determination
• Optimal assignment of slack due-dates and sequencing in a single-machine shop
• Survey of scheduling research involving due date determination decisions
• Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
• Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
• Optimal constant due-date assignment and sequencing
• Due Date Assignment for Production Systems
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal TWK-power due-date determination and sequencing
• Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop