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

DOI10.1137/0222078MaRDI QIDQ4277545zbMATH OpenOpenAlexFDO

Authors 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

heuristicmakespanidentical parallel machinespreemptive schedulingworst-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)

Recommendations

• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• A heuristic for preemptive scheduling with set-up times
• Scheduling batches on parallel machines with major and minor set-ups
• Parallel Machine Scheduling with Batch Setup Times

Cited in

(26)

• scientific article; zbMATH DE number 1420458 (Why is no real title available?)
• On the Complexity of Scheduling with Batch Setup Times
• Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
• Approximation algorithms for two-machine flow shop scheduling with batch setup times
• Scheduling with batch setup times and earliness-tardiness penalties
• A heuristic for preemptive scheduling with set-up times
• Resource constrained project scheduling subject to due dates: preemption permitted with penalty
• Scheduling batches on parallel machines with major and minor set-ups
• Strategic scheduling games: equilibria and efficiency
• Scheduling with batching: A review
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times
• A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
• Lot-sizing scheduling with batch setup times
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
• List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan
• Analysis of batched service time data using Gaussian and semi-parametric kernel models
• Scheduling identical parallel machines and operators within a period based changing mode
• Parallel machine scheduling with splitting jobs
• A heuristic algorithm for minimizing mean flow time with unit setups
• Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time
• Empowering the configuration-IP: new PTAS results for scheduling with setup times
• Bounds for parallel machine scheduling with predefined parts of jobs and setup time
• Product grouping for batch processes
• scientific article; zbMATH DE number 7559087 (Why is no real title available?)
• Parallel Machine Scheduling with Batch Setup Times

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

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