Necessary and sufficient conditions of optimality for some classical scheduling problems
From MaRDI portal
Publication:852941
DOI10.1016/j.ejor.2005.09.017zbMath1103.90043OpenAlexW2078711278MaRDI QIDQ852941
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
Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35)
Related Items (13)
Lawler's minmax cost algorithm: optimality conditions and uncertainty ⋮ 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 ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty ⋮ Scheduling to tradeoff between the number and the length of accepted jobs ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms ⋮ Minimizing the number of late jobs when the start time of the machine is variable ⋮ TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES ⋮ A note on the single machine scheduling to minimize the number of tardy jobs with deadlines ⋮ The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times ⋮ Inverse scheduling with maximum lateness objective
Cites Work
This page was built for publication: Necessary and sufficient conditions of optimality for some classical scheduling problems
