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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/166212 |