Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage

DOI10.1002/JOS.98zbMath1009.90044OpenAlexW1999244577MaRDI QIDQ1607975

Sergey Sevast'janov

Publication date: 8 August 2002

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

Full work available at URL: https://doi.org/10.1002/jos.98

zbMATH Keywords

approximationworst-case analysisuniform parallel machinesmultiprocessor flowshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines ⋮ Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ The hybrid flow shop scheduling problem ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time

Cites Work

• Unnamed Item
• Unnamed Item
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Minimizing makespan in hybrid flowshops
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops

This page was built for publication: Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage