Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

DOI<51::AID-JOS34>3.0.CO;2-K 10.1002/(SICI)1099-1425(200001/02)3:1<51::AID-JOS34>3.0.CO;2-KzbMath0966.90031MaRDI QIDQ1976518

Simon Dunstall, Andrew Wirth, Kenneth R. Baker

Publication date: 19 September 2000

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmschedulingsingle machinefamily set-up timesstatic job availability

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness ⋮ An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs ⋮ A survey of scheduling problems with setup times or costs ⋮ Approximation algorithms for problems in scheduling with set-ups ⋮ An online algorithm for a problem in scheduling with set-ups and release times ⋮ A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ Online Machine Scheduling with Family Setups

Cites Work

• Unnamed Item
• Single facility multi-class job scheduling
• Single facility scheduling with multiple job classes
• Scheduling two job classes on a single machine
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• Single facility scheduling with major and minor setups
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Batch scheduling to minimize total completion time
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• On the Complexity of Scheduling with Batch Setup Times
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Single Machine Scheduling with Major and Minor Setup Times: A Tabu Search Approach
• Sequencing n jobs on two machines with setup, processing and removal times separated
• Scheduling independent tasks to reduce mean finishing time
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Scheduling Groups of Jobs on a Single Machine
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
• Technical Note—Minimizing Average Flow Time with Parallel Machines