The total completion time open shop scheduling problem with a given sequence of jobs on one machine.
Ching-Fang LiawChun-Yuan ChengMingchih ChenPublished in: Comput. Oper. Res. (2002)
Keyphrases
- flowshop
- batch processing
- completion times
- parallel machines
- processing times
- scheduling problem
- job processing times
- strongly np hard
- release times
- unrelated parallel machines
- single machine
- material handling
- identical machines
- minimizing makespan
- parallel machine scheduling problem
- scheduling jobs
- special case
- release dates
- job scheduling
- real time
- wafer fabrication
- maximum lateness
- learning algorithm
- information systems
- case study