Job scheduling for maximum revenue on uniform, parallel machines with major and minor setups and job splitting
Authors:
- Geoffrey A. ChuaGCGeoffrey A. Chua
- Ashwin RavindranARAshwin Ravindran
- Juan Ramon L. SengaJSJuan Ramon L. Senga
- S. ViswanathanSVS. Viswanathan
- 8 March 2023
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 178
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Order acceptance and scheduling: A taxonomy and reviewEuropean Journal of Operational Research, 2011
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup timesComputers & Operations Research, 2010
- Knapsack problems with setupsEuropean Journal of Operational Research, 2009
- Exact and heuristic solution approaches for the mixed integer setup knapsack problemEuropean Journal of Operational Research, 2008
- Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum latenessComputers & Industrial Engineering, 1998
- Scheduling jobs on parallel machines with sequence-dependent setup timesEuropean Journal of Operational Research, 1997
- Selecting jobs for a heavily loaded shop with lateness penaltiesComputers & Operations Research, 1996
- On scheduling parallel machines with two setup classesInternational Journal of Production Research, 1991
- Scheduling batches on parallel machines with major and minor set-upsEuropean Journal of Operational Research, 1990
- The knapsack problem: A surveyNaval Research Logistics Quarterly, 1975