Scheduling problems with partially ordered jobs

DOI10.1134/S0005117910100036MaRDI QIDQ612206zbMATH OpenFDO

Authors Alexandre Dolgui, V. S. Gordon

Publication date 3 January 2011

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0005117910100036

zbMATH Keywords

partially ordered jobsscheduling

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Deterministic scheduling theory in operations research (90B35) Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• scientific article; zbMATH DE number 3883928
• Scheduling partially ordered jobs faster than \(2^{n }\)
• scientific article; zbMATH DE number 5605136
• Scheduling partially ordered jobs faster than \(2^n\)
• scientific article; zbMATH DE number 3943542

Cites work

• A note on optimal assignment of slack due-dates in single-machine scheduling
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
• scientific article; zbMATH DE number 1594563 (Why is no real title available?)
• scientific article; zbMATH DE number 3825547 (Why is no real title available?)
• scientific article; zbMATH DE number 3691044 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3612753 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• scientific article; zbMATH DE number 2159153 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 3208722 (Why is no real title available?)
• Optimal assignment of due-dates for preemptive single-machine scheduling
• Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Scheduling in a contaminated area: a model and polynomial algorithms
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Sequencing with ordered criteria, precedence and group technology constraints
• Sequencing with Series-Parallel Precedence Constraints
• Single machine scheduling and due date assignment under series-parallel precedence constraints
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
• Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Cited in

(8)

• Vyacheslav Tanaev: contributions to scheduling and related areas
• scientific article; zbMATH DE number 6611746 (Why is no real title available?)
• Scheduling partially ordered jobs faster than \(2^{n }\)
• scientific article; zbMATH DE number 4152133 (Why is no real title available?)
• scientific article; zbMATH DE number 3943542 (Why is no real title available?)
• scientific article; zbMATH DE number 3957178 (Why is no real title available?)
• Scheduling partially ordered jobs faster than \(2^n\)
• Partially ordered knapsack and applications to scheduling

This page was built for publication: Scheduling problems with partially ordered jobs

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