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: | 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
-
Specific job search self-efficacy beliefs and behaviors of unemployed ethnic minority women
by: VAN HOYE, Greet, et al.
Published: (2019) -
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
by: Iravani, S.M.R., et al.
Published: (2013) -
Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
by: CHEN, Changyu, et al.
Published: (2022) -
Reactive repair tool for job shop schedules
by: Subramaniam, V., et al.
Published: (2014) -
Reactive recovery of job shop schedules - A review
by: Raheja, A.S., et al.
Published: (2014)