Schedules for a two-stage hybrid flowshop with parallel machines at the second stage

1 July 1991

journal article
research article
Published by Taylor & Francis in International Journal of Production Research

Vol. 29 (7) , 1489-1502
https://doi.org/10.1080/00207549108948025

Abstract

Approximate solution algorithms are developed to find a minimum makespan schedule in a two-stage hybrid flowshop when the second stage consists of multiple identical machines. Computational experience comparing the ‘approximate’ makespans with their respective global lower bounds for large problems indicates that proposed polynomially bounded approximate algorithms are quite effective. It is shown that the proposed heuristic algorithms can be used to improve the efficiency of an existing branch and bound algorithm.

Keywords

This publication has 13 references indexed in Scilit:

Models and algorithms for a two-stage production process
Production Planning & Control, 1990
Two-Stage, Hybrid Flowshop Scheduling Problem
Journal of the Operational Research Society, 1988
Interstage Transportation Planning in the Deterministic Flow-Shop Environment
Operations Research, 1987
A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP
Decision Sciences, 1987
Sequencing Problems in Two-Server Systems
Mathematics of Operations Research, 1985
Scheduling in a two-stage manufacturing process
International Journal of Production Research, 1984
A Production Scheduling Problem in the Glass-Container Industry
Operations Research, 1979
Optimal schedules for special structure flowshops
Naval Research Logistics Quarterly, 1975
A Solution to a Special Class of Flow Shop Scheduling Problems
Published by Springer Nature ,1973
Optimal two‐ and three‐stage production schedules with setup times included
Naval Research Logistics Quarterly, 1954