Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models.
Nhan-Quy NguyenFarouk YalaouiLionel AmodeoHicham ChehadePascal ToggenburgerPublished in: ACIIDS (2) (2016)
Keyphrases
- single machine
- completion times
- minimize total
- scheduling problem
- sum of completion times
- release dates
- processing times
- parallel machines
- flowshop
- single machine scheduling problem
- setup times
- precedence constraints
- unrelated parallel machines
- sequence dependent setup times
- np hard
- weighted sum
- branch and bound algorithm
- tabu search
- dynamic programming
- cutting plane
- resource allocation
- graphical models
- cost function