Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
type: Item
instance of: scholarly article
title: Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
zbMATH Open document ID: 1037.90035
DOI: 10.1016/S0377-2217(02)00245-X
author: Xi Sun
author: Kazuko Morizawa
author: Hiroyuki Nagasawa
published in: European Journal of Operational Research
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1902778
zbMATH Keywords: Heuristics
zbMATH Keywords: parallel machines
zbMATH Keywords: flowshop scheduling
zbMATH Keywords: Makespan
MaRDI profile type: Publication
cites work: Branch and bound algorithm for the flow shop with multiple processors
cites work: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
cites work: Q3938812
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: A branch and bound algorithm for the two-stage assembly scheduling problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
cites work: Global lower bounds for flow shops with multiple processors
cites work: Scheduling algorithms for flexible flowshops: Worst and average case performance
description: scientific article; zbMATH DE number 1902778