A bicriteria approach to the two-machine flow shop scheduling problem.
Serpil SayinSelçuk KarabatiPublished in: Eur. J. Oper. Res. (1999)
Keyphrases
- bicriteria
- scheduling problem
- flowshop
- processing times
- single machine
- np hard
- setup times
- minimizing makespan
- tabu search
- maximum tardiness
- completion times
- precedence constraints
- efficient solutions
- parallel machines
- knapsack problem
- manufacturing cell
- np complete
- shortest path problem
- integer linear programming
- greedy algorithm
- upper bound
- lower bound
- optimal solution