A cyclical search for the two machine flow shop and open shop to minimise finishing time

DOI10.1007/s10951-013-0356-7zbMath1328.90060OpenAlexW2068762498MaRDI QIDQ2356124

Alan J. Soper

Publication date: 28 July 2015

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

Full work available at URL: https://doi.org/10.1007/s10951-013-0356-7

zbMATH Keywords

flow shopopen shopminimum makespan

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 (8)

A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ An FPTAS for scheduling with resource constraints ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ Three-machine open shop with a bottleneck machine revisited

Cites Work

• Unnamed Item
• Three is easy, two is hard: Open shop sum-batch scheduling problem refined
• Optimal two- and three-stage production schedules with setup times included
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: A cyclical search for the two machine flow shop and open shop to minimise finishing time