Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers.
Marie-Laure EspinouseGrzegorz PawlakMalgorzata SternaPublished in: J. Optim. Theory Appl. (2017)
Keyphrases
- single machine
- scheduling problem
- flexible manufacturing systems
- earliness tardiness
- total weighted tardiness
- processing times
- total tardiness
- setup times
- sequence dependent setup times
- maximum lateness
- minimize total
- manufacturing systems
- np hard
- flowshop
- release dates
- release times
- dispatching rule
- tabu search
- weighted number of tardy jobs
- weighted tardiness
- scheduling jobs
- production scheduling
- precedence constraints
- learning effect
- competitive ratio
- worst case
- minimizing makespan
- job shop
- parallel machines
- makespan minimization
- single machine scheduling problem
- production system
- real time control
- job shop scheduling problem
- computational complexity
- number of late jobs
- real time
- genetic algorithm
- dynamic programming
- strongly np hard