Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date.
C. S. SungJ. I. MinPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- batch processing
- scheduling problem
- flowshop
- earliness tardiness
- parallel machines
- single machine
- scheduling jobs
- minimizing total tardiness
- processing times
- sequence dependent setup times
- setup times
- bicriteria
- maximum lateness
- tabu search
- minimizing makespan
- strongly np hard
- flowshop scheduling
- precedence constraints
- preventive maintenance
- np hard
- genetic algorithm
- job processing times
- feasible solution
- special case