Scheduling a two-stage hybrid flowshop with separable setup and removal times

DOI10.1016/0377-2217(94)90407-3zbMath0809.90080OpenAlexW2036178373MaRDI QIDQ1333533

Enar A. Tunc, Jatinder N. D. Gupta

Publication date: 15 September 1994

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)90407-3

zbMATH Keywords

NP-completenessheuristic algorithmsidentical parallel machinestwo-stage flowshop schedulingpolynomial optimization algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis ⋮ Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop ⋮ Two-stage no-wait scheduling models with setup and removal times separated ⋮ A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines ⋮ A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups ⋮ Scheduling problems in master-slave model ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ A two-stage hybrid flowshop with uniform machines and setup times ⋮ A flexible flowshop problem with total flow time minimization ⋮ The hybrid flow shop scheduling problem ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A hybrid two-stage flowshop with part family, batch production, major and minor set-ups ⋮ Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines ⋮ Flowshop scheduling with identical jobs and uniform parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Job lateness in a two-machine flowshop with setup times separated
• Optimal two- and three-stage production schedules with setup times included
• Mathematical Modeling of Scheduling Problems
• Two-Stage, Hybrid Flowshop Scheduling Problem
• The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage
• Sequencing n jobs on two machines with setup, processing and removal times separated