Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function.
Nhan-Quy NguyenFarouk YalaouiLionel AmodeoHicham ChehadePascal ToggenburgerPublished in: Comput. Oper. Res. (2018)
Keyphrases
- flowshop
- scheduling problem
- job processing times
- completion times
- precedence constraints
- single machine
- processing times
- parallel machines
- minimizing makespan
- strongly np hard
- unrelated parallel machines
- minimizing total tardiness
- sequence dependent setup times
- batch processing
- setup times
- release dates
- parallel machine scheduling problem
- release times
- permutation flowshop
- special case
- makespan minimization
- linear constraints
- total tardiness
- maximum lateness
- single machine scheduling problem
- tardiness penalties
- np hard
- total weighted tardiness
- piecewise linear
- identical machines
- earliness tardiness
- identical parallel machines
- tabu search
- scheduling jobs
- global constraints
- traffic intensity
- weighted sum
- regression function
- scheduling decisions
- preventive maintenance
- objective function
- constrained minimization
- optimal scheduling
- stationary points
- branch and bound algorithm
- vehicle routing
- exponential decay
- search space
- lower bound