Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity

DOI10.1080/03155986.1997.11732335MaRDI QIDQ4380542zbMATH OpenOpenAlexFDO

Authors Michael Y. Wang, Suresh P. Sethi, Chelliah Sriskandarajah, Steef van de Velde

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

zbMATH Keywords

flowshop schedulingmakespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing makespan in a pallet-constrained flowshop
• scientific article; zbMATH DE number 5052107
• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard

Cited in

(6)

• Minimizing makespan in a pallet-constrained flowshop
• Heuristic procedures for minimizing makespan and the number of required pallets
• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
• scientific article; zbMATH DE number 5052107 (Why is no real title available?)
• A job-shop problem with one additional resource type

This page was built for publication: Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4380542)