Necessary and sufficient conditions of optimality for some classical scheduling problems

DOI10.1016/J.EJOR.2005.09.017MaRDI QIDQ852941zbMATH OpenOpenAlexFDO

Authors Yanpei Liu, Xiumei Wang

Publication date 15 November 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.09.017

zbMATH Keywords

partial orderscheduling problemscritical jobsoptimality characterization

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling algorithms based on necessary optimality conditions
• On the optimality of approximation schemes for the classical scheduling problem
• On number of optimal solutions in some scheduling problems
• Necessary optimality conditions for a generalized problem of production scheduling
• A new class of scheduling criteria and their optimization
• scientific article; zbMATH DE number 4031379
• scientific article; zbMATH DE number 1159455
• On the optimality of exact and approximation algorithms for scheduling problems
• On the potentially optimal solutions of classical shop scheduling problems
• Recent advances for a classical scheduling problem

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• Augmentations of consistent partial orders for the one-machine total tardiness problem

Cited in

(19)

• The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms
• scientific article; zbMATH DE number 2099626 (Why is no real title available?)
• Inverse scheduling with maximum lateness objective
• Single machine adversarial bilevel scheduling problems
• On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
• Optimality conditions for weak efficiency to vector optimization problems with composed convex functions
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Scheduling to tradeoff between the number and the length of accepted jobs
• On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs
• Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines
• Minimizing the number of late jobs when the start time of the machine is variable
• Lawler's minmax cost algorithm: optimality conditions and uncertainty
• Two-machine flow-shop minimum-length scheduling with interval processing times
• scientific article; zbMATH DE number 5629801 (Why is no real title available?)
• Necessary optimality conditions for a generalized problem of production scheduling
• scientific article; zbMATH DE number 3908144 (Why is no real title available?)
• Inverse scheduling: Two-machine flow-shop problem
• On number of optimal solutions in some scheduling problems

This page was built for publication: Necessary and sufficient conditions of optimality for some classical scheduling problems

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