View Author
pallet problem machine operation schedule makespan partition pallet requirements research system np-hard instance scheduling sense 2 5 processing requirement theorem figure operations research complexity proof management no-passing university sethi manufacturing partition jobs number paper work pieces manufacturing systems flowshop journal velde pallet requirement element johnson question section sriskandarajah integer production 3- partition toronto gantt chart supply chain management fiowshop problem 2- partition t disjoint subsets job sets job j 3t fiowshop processing time theorem 2 theorem 1 machine scheduling theory operations management processing times buffer pacesetting engineering control professor piece reduction result vector resource viewpoint p-buffer problem pallet-holding jobs pallet-holding performance disjoint p-buffer management science t jobs garey jt +i
2 Most Recent Publications
|
Scheduling a batching machine
(Article)
Wang, M. Sethi, S. Velde, S.L. van de |
1997-01-01
|
|
Minimizing makespan in flowshops with pallet requirements: computational complexity
(Article)
Wang, M. Sethi, S. Sriskandarajah, C. Velde, S.L. van de |
1997-01-01
|