Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
type: Item
instance of: scholarly article
title: Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration
zbMATH Open document ID: 1303.90043
author: Louis Caccetta
author: Syarifah Z. Nordin
published in: Numerical Algebra, Control and Optimization
publication date: 2014-12-05T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6376983
zbMATH Keywords: scheduling problem
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: parallel processor system
zbMATH Keywords: unrelated parallel processor
zbMATH Keywords: priority consideration
describes a project that uses: AIMMS
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: naco.2014.4.115
OpenAlex ID: W2052353469
cites work: A survey of scheduling problems with setup times or costs
cites work: Scheduling on unrelated machines under tree-like precedence constraints
cites work: Mathematical programming formulations for machine scheduling: A survey
cites work: Q4247460
cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
cites work: Unrelated parallel machine scheduling using local search
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
cites work: Heuristics for unrelated machine scheduling with precedence constraints
cites work: Preemptive scheduling with rejection
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q3206316
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
cites work: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
cites work: Exact and approximation algorithms for makespan minimization on unrelated parallel machines
cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines
cites work: An approximation algorithm for the generalized assignment problem
cites work: An effective heuristic for minimising makespan on unrelated parallel machines
DOI: 10.3934/NACO.2014.4.115
description: scientific article; zbMATH DE number 6376983