Integer models for the interrupt-oriented services of jobs by single machine

MaRDI QIDQ5264755zbMATH OpenFDO

Authors R. Yu. Simanchev, N. Yu. Shereshik

Publication date 27 July 2015

Full work available at URL http://mathnet.ru/eng/da788

zbMATH Keywords

combinatorial optimizationpolyhedral conepolytopesubgraph

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine
• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
• Integer preemptive scheduling on parallel machines
• Mathematical models for preemptive shop scheduling problems
• Using integer programming to solve the machine scheduling problem with a flexible maintenance activity

Cited in

(5)

• On the polytope faces of the graph approximation problem
• Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine
• The affine hull of the schedule polytope for servicing identical requests by parallel devices
• An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences
• An integer model with optimality conditions for the total weighted tardiness problem on a single machine

This page was built for publication: Integer models for the interrupt-oriented services of jobs by single machine

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