A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Authors:
- Philippe BaptistePBPhilippe Baptiste
- Laurent PeridyLPLaurent Peridy
- Eric PinsonEPEric Pinson
- 1 January 2003
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 144 (1) , 1-11
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing timesJournal of Scheduling, 1999
- An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobsOperations Research Letters, 1999
- Minimizing late jobs in the general one machine scheduling problemEuropean Journal of Operational Research, 1995
- The job-shop problem and immediate selectionAnnals of Operations Research, 1994
- Adjustment of heads and tails for the job-shop problemEuropean Journal of Operational Research, 1994
- A branch and bound algorithm for the job-shop scheduling problemDiscrete Applied Mathematics, 1994
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982
- Ordonnancements à contraintes disjonctivesRAIRO - Operations Research, 1978