Heuristic procedures for minimizing makespan and the number of required pallets

DOI10.1016/0377-2217(94)00059-LzbMath0913.90163OpenAlexW2061931336MaRDI QIDQ1390237

Chengbin Chu, Suresh P. Sethi, Jean Marie Proth

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00059-l

zbMATH Keywords

makespanheuristicflow-shop schedulingresource optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• On two-machine scheduling with release and due dates to minimize maximum lateness
• A new heuristic for the n-job, M-machine flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• A survey and evaluation of static flowshop scheduling heuristics
• On general routing problems
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Heuristic procedures for minimizing makespan and the number of required pallets