Heuristic methods for the identical parallel machine flowtime problem with set-up times
From MaRDI portal
Publication:1772875
DOI10.1016/j.cor.2004.03.013zbMath1116.90348OpenAlexW2133964684MaRDI QIDQ1772875
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Parallel machines scheduling with machine preference via agent-based approach ⋮ An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times ⋮ A survey of scheduling problems with setup times or costs ⋮ 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 ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ Iterated greedy algorithms for a complex parallel machine scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Single facility scheduling with multiple job classes
- Weighted flow time bounds for scheduling identical processors
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Batch scheduling with deadlines on parallel machines
- Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
- The complexity of scheduling job families about a common due date
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Batch scheduling to minimize total completion time
- Scheduling with batching: A review
- Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- On the Complexity of Scheduling with Batch Setup Times
- A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- 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
- Scheduling with parallel processors and linear delay costs
- A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
