A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
type: Item
instance of: scholarly article
title: A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
zbMATH Open document ID: 1043.90034
DOI: 10.1016/S0377-2217(02)00524-6
author: Henry W. Thornton
author: John L. Hunsucker
published in: European Journal of Operational Research
publication date: 2003-10-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1992615
zbMATH Keywords: Scheduling
zbMATH Keywords: Heuristics
zbMATH Keywords: Makespan
zbMATH Keywords: Flow shop
zbMATH Keywords: Multiple processors
MaRDI profile type: Publication
cites work: Q4230896
cites work: Heuristics for scheduling in a flow shop with multiple processors
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: Q4840097
cites work: Optimal Order for Servers in Series with No Queue Capacity
cites work: Q3938812
cites work: On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room
cites work: No-wait shop scheduling: Computational complexity and approximate algorithms
cites work: Optimal flowshop schedules with no intermediate storage space
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Flowshop sequencing problems with limited buffer storage
cites work: The permutation flow shop with buffers: A tabu search approach
cites work: Q3525910
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: Q4051864
cites work: FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
cites work: Global lower bounds for flow shops with multiple processors
cites work: Performance of scheduling algorithms for no-wait flowshops with parallel machines
cites work: Some no-wait shops scheduling problems: Complexity aspect
cites work: An Adaptable Scheduling Algorithm for Flexible Flow Lines
cites work: Q4264751
description: scientific article; zbMATH DE number 1992615