Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
DOI10.3934/NACO.2014.4.115zbMATH Open1303.90043OpenAlexW2052353469MaRDI QIDQ478929FDOQ478929
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
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
mixed integer linear programmingscheduling problemparallel processor systempriority considerationunrelated parallel processor
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Mixed integer programming (90C11)
Cites Work
- An approximation algorithm for the generalized assignment problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A survey of scheduling problems with setup times or costs
- Approximation algorithms for scheduling unrelated parallel machines
- Preemptive scheduling with rejection
- Mathematical programming formulations for machine scheduling: A survey
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Title not available (Why is that?)
- Unrelated parallel machine scheduling using local search
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
- An effective heuristic for minimising makespan on unrelated parallel machines
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Heuristics for unrelated machine scheduling with precedence constraints
- Scheduling on unrelated machines under tree-like precedence constraints
- Title not available (Why is that?)
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
Uses Software
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)
