Optimal total-work-content-power due-date determination and sequencing
From MaRDI portal
DOI10.1016/0898-1221(87)90184-2zbMATH Open0634.90028OpenAlexW1965688964MaRDI QIDQ1097161FDOQ1097161
Authors: T. C. Edwin Cheng 
Publication date: 1987
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(87)90184-2
Recommendations
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
- Optimal TWK-power due-date determination and sequencing
- Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop
- A simpler and faster algorithm for optimal total-work-content-power due data determination
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
Cites Work
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Due Date Assignment for Production Systems
- Optimal due-date assignment in a job shop†
- Optimal Due-Date Determination and Sequencing of n Jobs on a Single Machine
- Simulation study of job shop scheduling with due dates
Cited In (7)
- Some observations and extensions of the optimal TWK-power due-date determination and sequencing problem
- Optimal due-date assignment in a job shop†
- A simpler and faster algorithm for optimal total-work-content-power due data determination
- Scheduling job classes on uniform machines
- Survey of scheduling research involving due date determination decisions
- Analytical determination of optimal TWK due-dates in a job shop
- Optimal TWK-power due-date determination and sequencing
This page was built for publication: Optimal total-work-content-power due-date determination and sequencing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097161)
