Due-date assignment and single machine scheduling with compressible processing times
- 1 May 1996
- journal article
- Published by Elsevier BV in International Journal of Production Economics
- Vol. 43 (1), 29-35
- https://doi.org/10.1016/0925-5273(95)00194-8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Resource optimal control in some single-machine scheduling problemsIEEE Transactions on Automatic Control, 1994
- Two parallel machine sequencing problems involving controllable job processing timesEuropean Journal of Operational Research, 1993
- Single-machine sequencing with controllable processing timesEuropean Journal of Operational Research, 1992
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysisOperations Research Letters, 1991
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs TardyOperations Research, 1989
- Survey of scheduling research involving due date determination decisionsEuropean Journal of Operational Research, 1989
- A two-machine flow shop scheduling problem with controllable job processing timesEuropean Journal of Operational Research, 1988
- A bicriterion approach to time/cost trade-offs in sequencingEuropean Journal of Operational Research, 1982
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single MachineOperations Research, 1980
- Two Single Machine Sequencing Problems Involving Controllable Job Processing TimesA I I E Transactions, 1980