Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines

DOI10.1007/s10951-016-0471-3zbMath1386.90046OpenAlexW2328918813WikidataQ59469794 ScholiaQ59469794MaRDI QIDQ1702729

Natalia V. Shakhlevich, Peter Brucker

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0471-3

zbMATH Keywords

optimality conditionsparallel machine schedulingunit processing times

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Scheduling equal processing time jobs to minimize the weighted number of late jobs
• Negative-cycle detection algorithms
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Scheduling identical jobs on uniform parallel machines
• Inverse Optimization

This page was built for publication: Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines