Minimizing makespan in a pallet-constrained flowshop

DOI<115::AID-JOS20>3.0.CO;2-U 10.1002/(SICI)1099-1425(199905/06)2:3<115::AID-JOS20>3.0.CO;2-UzbMath0949.90046OpenAlexW3122821775MaRDI QIDQ1295835

Suresh P. Sethi, Michael Y. Wang, Chelliah Skriskandarajah, Steef L. van de Velde, Hoogeveen, J. A.

Publication date: 5 October 1999

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199905/06)2:3<115::aid-jos20>3.0.co;2-u

zbMATH Keywords

flexible manufacturing systemsschedulingheuristic algorithmsflowshoppallets

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A job-shop problem with one additional resource type, Decomposition algorithms for synchronous flow shop problems with additional resources and setup times, A review of TSP based approaches for flowshop scheduling

Cites Work

• Scheduling subject to resource constraints: Classification and complexity
• On queueing network models of flexible manufacturing systems
• Optimal two- and three-stage production schedules with setup times included
• Flowshop scheduling with limited temporary storage
• Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem