Job scheduling for maximum revenue on uniform, parallel machines with major and minor setups and job splitting

• المؤلفون الرئيسيون: Chua, Geoffrey A., Ravindran, Ashwin, Senga, Juan Ramon L., Viswanathan, Sivakumar
• مؤلفون آخرون: Nanyang Business School
• التنسيق: مقال
• اللغة: English
• منشور في: 2023
• الموضوعات: Business::Information technology; Job Scheduling; Major and Minor Setups
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/166212
• المؤسسة: Nanyang Technological University

We consider a revenue maximization scheduling problem where jobs can be split on parallel, uniform machines. By assuming that only major and minor setups exist between jobs and that these can be grouped into families, we reformulate the scheduling problem as a continuous knapsack problem with setup...