Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration

DOI10.3934/NACO.2014.4.115MaRDI QIDQ478929zbMATH OpenOpenAlexFDO

Authors Louis Caccetta, Syarifah Z. Nordin

Publication date 5 December 2014

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/naco.2014.4.115

zbMATH Keywords

mixed integer linear programmingscheduling problemparallel processor systempriority considerationunrelated parallel processor

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11)

Recommendations

• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
• Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
• Computing optimal preemptive schedules for parallel tasks: linear programming approaches
• A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server
• Optimal Scheduling of Tasks on Identical Parallel Processors

Cites work

• scientific article; zbMATH DE number 3648122 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• A survey of scheduling problems with setup times or costs
• A survey of the state-of-the-art of common due date assignment and scheduling research
• An approximation algorithm for the generalized assignment problem
• An effective heuristic for minimising makespan on unrelated parallel machines
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• Exact and approximation algorithms for makespan minimization on unrelated parallel machines
• Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
• Heuristics for unrelated machine scheduling with precedence constraints
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Mathematical programming formulations for machine scheduling: A survey
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive scheduling with rejection
• Scheduling on unrelated machines under tree-like precedence constraints
• Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
• Unrelated parallel machine scheduling using local search

Cited in

(1)

• Task scheduling for multiunit parallel test using mixed-integer linear programming

Describes a project that uses

Uses Software

• AIMMS
• CPLEX

This page was built for publication: Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration

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