Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times

DOI10.1287/OPRE.41.5.981zbMATH Open0795.90034OpenAlexW1987135795MaRDI QIDQ4286476FDOQ4286476

Authors: Clyde l. Monma, Chris N. Potts 

Publication date: 6 April 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.5.981

Recommendations

• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• On-line machine scheduling with batch setups
• A heuristic for preemptive scheduling with set-up times
• Non-preemptive scheduling on machines with setup times
• On the Complexity of Scheduling with Batch Setup Times

zbMATH Keywords

identical parallel machinesmaximum completion timepreemptively scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (29)

• Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
• 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
• Resource constrained project scheduling subject to due dates: preemption permitted with penalty
• A heuristic for preemptive scheduling with set-up times
• Scheduling batches on parallel machines with major and minor set-ups
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
• Scheduling with batching: A review
• Machine scheduling with job class setup and delivery considerations
• 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
• Non-preemptive Scheduling on Machines with Setup Times
• Parallel machine scheduling with precedence constraints and setup times
• Parallel machine scheduling with splitting jobs
• Approximations and auctions for scheduling batches on related machines
• Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
• Minimizing flow-time on a single machine with integer batch sizes
• 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
• Title not available (Why is that?)
• Product grouping for batch processes
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Scheduling preemptive jobs with precedence constraints on parallel machines

This page was built for publication: Analysis of Heuristics 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 Q4286476)