Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
From MaRDI portal
Publication:4380542
DOI10.1080/03155986.1997.11732335zbMath0894.90085OpenAlexW1501009594MaRDI QIDQ4380542
Michael Y. Wang, Steef L. van de Velde, Suresh P. Sethi, Chelliah Skriskandarajah
Publication date: 7 September 1998
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/12344
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
A job-shop problem with one additional resource type, Minimizing makespan in a pallet-constrained flowshop