Semi-on-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Three Special Uniform Machines.
Runzi LuoShijie SunPublished in: Asia Pac. J. Oper. Res. (2005)
Keyphrases
- flowshop
- scheduling problem
- parallel machine scheduling problem
- parallel machines
- sequence dependent setup times
- single machine
- processing times
- minimizing total tardiness
- setup times
- bicriteria
- minimizing makespan
- tabu search
- identical machines
- special case
- np hard
- maximum lateness
- total tardiness
- unrelated parallel machines
- permutation flowshop
- precedence constraints
- total weighted tardiness
- release dates
- earliness tardiness
- minimum cost
- strongly np hard
- square error
- job shop scheduling problem
- identical parallel machines
- scheduling decisions
- completion times
- data sets