Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
Authors:
- Fabrice Talla NobibonFNFabrice Talla Nobibon
- Roel LeusRLRoel Leus
- 1 January 2011
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 38 (1) , 367-378
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Time-Indexed Formulations and the Total Weighted Tardiness ProblemINFORMS Journal on Computing, 2008
- Techniques for scheduling with rejectionJournal of Algorithms, 2003
- On-line scheduling of unit time jobs with rejection: minimizing the total completion timeOperations Research Letters, 2002
- Greedy solutions of selection and ordering problemsEuropean Journal of Operational Research, 2001
- Approximation algorithms for the job interval selection problem and related scheduling problems2001
- Job selection in a heavily loaded shopComputers & Operations Research, 1997
- An efficient cost scaling algorithm for the assignment problemMathematical Programming, 1995
- Note—Project Selection and Sequencing to Maximize Net Present Value of the Total ReturnManagement Science, 1992
- On the minimization of the weighted number of tardy jobs with random processing times and deadlineComputers & Operations Research, 1991
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969