Concurrent flowshop scheduling to minimize makespan.
type: Item
instance of: scholarly article
title: Concurrent flowshop scheduling to minimize makespan.
zbMATH Open document ID: 1056.90070
DOI: 10.1016/S0377-2217(03)00142-5
published in: European Journal of Operational Research
publication date: 2004-05-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2066869
zbMATH Keywords: Flowshop scheduling
zbMATH Keywords: Concurrent operations
zbMATH Keywords: Approximation/heuristic
zbMATH Keywords: Worst case analysis
author: C. Koulamas
author: George J. Kyparisis
MaRDI profile type: Publication
cites work: The tricriteria two-machine flowshop scheduling problem
cites work: Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Assembly-line scheduling with concurrent operations and parallel machines
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: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
cites work: On some geometric methods in scheduling theory: A survey
cites work: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
cites work: Minimizing Makespan in a Class of Reentrant Shops
cites work: A heuristic algorithm for mean flowtime objective in flowshop scheduling
full work available at URL: s0377-2217(03)00142-5
OpenAlex ID: W1996331245
Recommended article: Minimizing makespan in parallel flowshops
Recommended article: Minimizing the makespan for the flow shop scheduling problem with availability constraints.
Recommended article: A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
Recommended article: Q4352233
Recommended article: Flowshop-scheduling problems with makespan criterion: a review
Recommended article: Flow shop-sequencing problem with synchronous transfers and makespan minimization
Recommended article: Scheduling chain-structured tasks to minimize makespan and mean flow time
Recommended article: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
Recommended article: Scheduling in flowshops to minimize total tardiness of jobs
Recommended article: Minimizing makespan in hybrid flowshops
description: scientific article; zbMATH DE number 2066869