Heuristic methods for the identical parallel machine flowtime problem with set-up times
type: Item
instance of: scholarly article
title: Heuristic methods for the identical parallel machine flowtime problem with set-up times
zbMATH Open document ID: 1116.90348
author: Simon Dunstall
author: Andrew Wirth
published in: Computers \& Operations Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2160321
zbMATH Keywords: Parallel machine scheduling
zbMATH Keywords: Family set-up times
zbMATH Keywords: Heuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2004.03.013
OpenAlex ID: W2133964684
cites work: Scheduling with batching: A review
cites work: Q3995531
cites work: Batch scheduling to minimize total completion time
cites work: Q4713573
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
cites work: Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: The complexity of scheduling job families about a common due date
cites work: On the minimization of total weighted flow time with identical and uniform parallel machines
cites work: A new dynamic programming algorithm for the parallel machines total weighted completion time problem
cites work: Weighted flow time bounds for scheduling identical processors
cites work: Scheduling with parallel processors and linear delay costs
cites work: Batch scheduling with deadlines on parallel machines
cites work: A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
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
cites work: A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
cites work: Scheduling parallel machines to minimize weighted flowtime with family set-up times
cites work: A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
cites work: Dynamic programming algorithms for scheduling parallel machines with family setup times
cites work: Scheduling Groups of Jobs on a Single Machine
cites work: Single facility scheduling with multiple job classes
cites work: A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
DOI: 10.1016/J.COR.2004.03.013
Recommended article: Heuristic scheduling of parallel machines with sequence-dependent set-up times
Recommended article: Heuristic and exact algorithms for the identical parallel machine scheduling problem
Recommended article: An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
Recommended article: Q4944735
Recommended article: Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
Recommended article: Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
Recommended article: Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
Recommended article: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
Recommended article: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
description: scientific article; zbMATH DE number 2160321