Scheduling parallel processors to minimize setup time

DOI10.1016/0305-0548(87)90068-2MaRDI QIDQ1820684zbMATH OpenOpenAlexFDO

Authors Robert T. Sumichrast

Publication date 1987

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(87)90068-2

zbMATH Keywords

scheduling parallel processors

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09) Applications of mathematical programming (90C90)

Review text

The problem of scheduling parallel processors in a make-to-stock environment with sequence-dependent setup costs is considered. A new algorithm which formulates a series of 0/1 integer subproblems is proposed and contrasted with an earlier formulation. Parallels between the subproblem formulations and generalized network are discussed.

Recommendations

• Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
• A nonidentical parallel processor scheduling problem
• Production scheduling of independent jobs on parallel identical processors

Cites work

• Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors

Cited in

(3)

• Production planning problem with sequence dependent setups as a bilevel programming problem
• Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints

This page was built for publication: Scheduling parallel processors to minimize setup time

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