Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times.
Hajar NouinouTaha ArbaouiAlice YalaouiPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- processing times
- scheduling problem
- single machine
- release dates
- single machine scheduling problem
- worst case performance ratio
- setup times
- completion times
- scheduling jobs
- polynomially solvable
- precedence relations
- release times
- online learning
- identical machines
- total weighted tardiness
- identical parallel machines
- flowshop
- deteriorating jobs
- np hard
- learning effect
- job shop
- maximum lateness