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...
Saved in:
Main Authors: | , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2023
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/166212 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |