Exact resolution of the one-machine sequencing problem with no machine idle time
Authors:
- Jacques CarlierJCJacques Carlier
- Fatma HermèsFHFatma Hermès
- Aziz MoukrimAMAziz Moukrim
- Khaled GhédiraKGKhaled Ghédira
- 1 September 2010
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 59 (2) , 193-199
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- On single-machine scheduling without intermediate delaysDiscrete Applied Mathematics, 2008
- Scheduling unit tasks to minimize the number of idle periods2006
- Jackson's Pseudo Preemptive Schedule for the Pm/r i , q i /C max scheduling problemAnnals of Operations Research, 1998
- Scheduling Algorithms1995
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- A block approach for single-machine scheduling with release dates and due datesEuropean Journal of Operational Research, 1986
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Minimizing maximum lateness on one machine: computational experience and some applicationsStatistica Neerlandica, 1976
- Sequencing with due‐dates and early start times to minimize maximum tardinessNaval Research Logistics Quarterly, 1974
- On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problemNaval Research Logistics Quarterly, 1973