Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry.
Vincent T'kindtJean-Charles BillautChristian ProustPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- bicriteria
- flowshop
- unrelated parallel machines
- scheduling problem
- setup times
- completion times
- parallel machines
- processing times
- single machine
- strongly np hard
- np hard
- minimizing makespan
- open shop
- special case
- tabu search
- precedence constraints
- efficient solutions
- integer linear programming
- job shop
- single machine scheduling problem
- approximation algorithms
- combinatorial optimization