A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times

DOI10.1137/0222078zbMath0806.90061OpenAlexW2010632596MaRDI QIDQ4277545

Bo Chen

Publication date: 7 February 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222078

zbMATH Keywords

makespanheuristicpreemptive schedulingidentical parallel machinesworst-case performance ratiobatch setup times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (14)

Analysis of batched service time data using Gaussian and semi-parametric kernel models ⋮ Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting ⋮ Lot-sizing scheduling with batch setup times ⋮ Strategic Scheduling Games: Equilibria and Efficiency ⋮ Bounds for parallel machine scheduling with predefined parts of jobs and setup time ⋮ Scheduling with batching: A review ⋮ Resource constrained project scheduling subject to due dates: preemption permitted with penalty ⋮ Heuristic methods for the identical parallel machine flowtime problem with set-up times ⋮ Unnamed Item ⋮ Scheduling with batch setup times and earliness-tardiness penalties ⋮ Parallel machine scheduling with splitting jobs ⋮ Approximation algorithms for two-machine flow shop scheduling with batch setup times ⋮ Empowering the configuration-IP: new PTAS results for scheduling with setup times ⋮ Product grouping for batch processes

This page was built for publication: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times