Semi On-Line Scheduling Problem for Maximizing the Minimum Machine Completion Time on Two Uniform Machines.
Runzi LuoShijie SunWen-Ping HuangPublished in: J. Syst. Sci. Complex. (2006)
Keyphrases
- flowshop
- scheduling problem
- parallel machine scheduling problem
- parallel machines
- processing times
- single machine
- minimizing total tardiness
- bicriteria
- setup times
- sequence dependent setup times
- minimizing makespan
- maximum lateness
- total tardiness
- tabu search
- np hard
- special case
- unrelated parallel machines
- total weighted tardiness
- earliness tardiness
- strongly np hard
- permutation flowshop
- precedence constraints
- minimum cost
- identical machines
- completion times
- linear array
- square error
- preventive maintenance
- search space
- job shop scheduling problem