Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
type: Item
instance of: scholarly article
title: Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
zbMATH Open document ID: 0966.90031
author: Simon Dunstall
author: Andrew Wirth
author: Kenneth R. Baker
published in: Journal of Scheduling
publication date: 2000-09-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1445658
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: family set-up times
zbMATH Keywords: static job availability
zbMATH Keywords: branch-and-bound algorithm
MaRDI profile type: Publication
cites work: Batch scheduling to minimize total completion time
cites work: Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Q4713573
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Scheduling two job classes on a single machine
cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
cites work: Single facility multi-class job scheduling
cites work: Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
cites work: Single facility scheduling with multiple job classes
cites work: Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
cites work: A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
cites work: Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
cites work: Single facility scheduling with major and minor setups
cites work: Sequencing n jobs on two machines with setup, processing and removal times separated
cites work: Single machine scheduling with batch set-up times to minimize maximum lateness
cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
DOI: 10.1002/(SICI)1099-1425(200001/02)3:1%3C51::AID-JOS34%3E3.0.CO;2-K
description: scientific article; zbMATH DE number 1445658