Minimizing makespan in a pallet-constrained flowshop

DOI10.1002/(SICI)1099-1425(199905/06)2:3%3C115::AID-JOS20%3E3.0.CO;2-UMaRDI QIDQ1295835zbMATH OpenOpenAlexFDO

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

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%3C115::aid-jos20%3E3.0.co;2-u

zbMATH Keywords

flexible manufacturing systemsflowshopheuristic algorithmspalletsscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
• Heuristic procedures for minimizing makespan and the number of required pallets
• Approximation algorithms for the parallel flow shop problem
• Two-machine flow shops with an optimal permutation schedule under a storage constraint

Cites work

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

Cited in

(8)

• Heuristic procedures for minimizing makespan and the number of required pallets
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan
• A review of TSP based approaches for flowshop scheduling
• Minimizing makespan and throughput times at Aalsmeer flower auction
• Minimizing makespan in parallel flowshops
• Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
• A job-shop problem with one additional resource type

This page was built for publication: Minimizing makespan in a pallet-constrained flowshop

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