Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time

DOI10.1080/00207548708919875zbMATH Open0621.90039OpenAlexW2028072612MaRDI QIDQ3758549FDOQ3758549

Authors: Robert T. Sumichrast, Joanna R. Baker 

Publication date: 1987

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207548708919875

Recommendations

• Scheduling parallel processors to minimize setup time
• Parallel machine scheduling, linear programming, and parameter list scheduling heuristics
• Processor Scheduling for Linearly Connected Parallel Processors
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• Some Heuristics for Scheduling Jobs on Parallel Machines with Setups
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• A parallel approximation scheme for the multiprocessor scheduling problem
• Publication:4944735

zbMATH Keywords

approximationinteger linear programmingproduction planningheuristic solutiongeneralized networksscheduling of parallel processors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Production models (90B30)

Cited In (5)

• Robust scheduling of parallel machines with sequence-dependent set-up costs
• Scheduling parallel processors to minimize setup time
• Title not available (Why is that?)
• Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
• Mathematical Modeling of Scheduling Problems

This page was built for publication: Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time

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