Heuristic methods for the identical parallel machine flowtime problem with set-up times

DOI10.1016/J.COR.2004.03.013MaRDI QIDQ1772875zbMATH OpenOpenAlexFDO

Authors Simon Dunstall, Andrew Wirth

Publication date 21 April 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.03.013

zbMATH Keywords

HeuristicsParallel machine schedulingFamily set-up times

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Heuristic and exact algorithms for the identical parallel machine scheduling problem
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
• Publication:4944735
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 10435 (Why is no real title available?)
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Batch scheduling to minimize total completion time
• Batch scheduling with deadlines on parallel machines
• Dynamic programming algorithms for scheduling parallel machines with family setup times
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• On the Complexity of Scheduling with Batch Setup Times
• On the minimization of total weighted flow time with identical and uniform parallel machines
• Scheduling Groups of Jobs on a Single Machine
• Scheduling independent tasks to reduce mean finishing time
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Scheduling with batching: A review
• Scheduling with parallel processors and linear delay costs
• Single facility scheduling with multiple job classes
• The complexity of scheduling job families about a common due date
• Weighted flow time bounds for scheduling identical processors

Cited in

(16)

• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Parallel machines scheduling with machine preference via agent-based approach
• scientific article; zbMATH DE number 1420458 (Why is no real title available?)
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
• Dynamic programming algorithms for scheduling parallel machines with family setup times
• Parallel machine scheduling by family batching with sequence-independent set-up times
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
• Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
• Planning production using mathematical programming: The case of a woodturning company
• Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
• scientific article; zbMATH DE number 2166902 (Why is no real title available?)
• A survey of scheduling problems with setup times or costs
• A heuristic algorithm for minimizing mean flow time with unit setups
• Iterated greedy algorithms for a complex parallel machine scheduling problem

This page was built for publication: Heuristic methods for the identical parallel machine flowtime problem with set-up times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772875)