An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints.
Fayçal BelkaidFarouk YalaouiZaki SariPublished in: Int. J. Inf. Syst. Supply Chain Manag. (2016)
Keyphrases
- parallel machines
- scheduling problem
- precedence constraints
- unrelated parallel machines
- earliness tardiness
- total tardiness
- single machine
- sequence dependent setup times
- setup times
- flowshop
- resource constraints
- minimize total
- makespan minimization
- maximum lateness
- massively parallel
- np hard
- release dates
- weighted tardiness
- job shop scheduling problem
- scheduling jobs
- tabu search
- total weighted tardiness
- parallel computing
- processing times
- single server
- open shop
- shared memory
- identical parallel machines
- job shop
- lower and upper bounds
- resource allocation