An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
type: Item
instance of: scholarly article
title: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
zbMATH Open document ID: 1186.90050
author: Hatem Hadda
author: Najoua Dridi
author: Sonia Hajri-Gabouj
published in: 4OR
publication date: 2010-05-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5710622
zbMATH Keywords: flow shop
zbMATH Keywords: worst case analysis
MaRDI profile type: Publication
full work available at URL: s10288-009-0102-3
OpenAlex ID: W2046510690
cites work: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
cites work: An improved heuristic for two-machine flowshop scheduling with an availability constraint
cites work: The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis
cites work: Scheduling two-stage hybrid flow shop with availability constraints
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
cites work: Two-machine flowshop scheduling with availability constraints
DOI: 10.1007/S10288-009-0102-3
Recommended article: An improved heuristic for two-machine flowshop scheduling with an availability constraint
Recommended article: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
Recommended article: Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Recommended article: Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
Recommended article: An improved algorithm for the two machine flow shop problem with several availability constraints
Recommended article: Two-machine flowshop scheduling with availability constraints
Recommended article: A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
Recommended article: Two-machine flowshop scheduling with consecutive availability constraints
Recommended article: An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
Recommended article: Approximability of two-machine no-wait flowshop scheduling with availability constraints.
description: scientific article; zbMATH DE number 5710622