On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine.
Philine GeserHoang Thanh LeTom HartmannMartin MiddendorfPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- processing times
- flowshop
- scheduling problem
- scheduling decisions
- scheduling jobs
- identical machines
- single machine
- shortest processing time
- setup times
- completion times
- total weighted tardiness
- sequence dependent setup times
- evolutionary algorithm
- resource consumption
- parallel machines
- tabu search
- special case
- batch processing
- np hard
- earliness tardiness
- job processing times