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

DOI10.1002/JOS.98zbMATH Open1009.90044OpenAlexW1999244577MaRDI QIDQ1607975FDOQ1607975

Authors: Sergey Sevastyanov 

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

Recommendations

• Flowshop scheduling with identical jobs and uniform parallel machines
• Flexible flow shop scheduling with uniform parallel machines
• scientific article; zbMATH DE number 776077
• scientific article; zbMATH DE number 1500536
• A multi-stage parallel-processor flowshop problem with minimum flowtime

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)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• The Complexity of Flowshop and Jobshop Scheduling
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Minimizing makespan in hybrid flowshops
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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

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