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

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Chua, Geoffrey A., Ravindran, Ashwin, Senga, Juan Ramon L., Viswanathan, Sivakumar
Other Authors: Nanyang Business School
Format: Article
Language:English
Published: 2023
Subjects:
Online Access:https://hdl.handle.net/10356/166212
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English

Similar Items