Approximation algorithms for two-machine flow shop scheduling with batch setup times
type: Item
instance of: scholarly article
title: Approximation algorithms for two-machine flow shop scheduling with batch setup times
zbMATH Open document ID: 0920.90070
DOI: 10.1007/BF01585875
author: Bo Chen
author: Chris N. Potts
author: V. A. Strusevich
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1294694
zbMATH Keywords: approximation algorithm
zbMATH Keywords: independent jobs
zbMATH Keywords: two-machine flow shop
zbMATH Keywords: makespan
zbMATH Keywords: batch setup time
zbMATH Keywords: NP-hard
zbMATH Keywords: heuristic algorithms
zbMATH Keywords: worst-case performance
MaRDI profile type: Publication
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Two-machine shop scheduling problems with batch processing
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
cites work: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
full work available at URL: https://doi.org/10.1007/bf01585875
OpenAlex ID: W2025039409
description: scientific article; zbMATH DE number 1294694