Developing feasible and optimal schedules of jobs on one machine

DOI10.1007/s10559-012-9392-0zbMath1276.68042OpenAlexW2063081335MaRDI QIDQ380659

Yu. A. Zack

Publication date: 14 November 2013

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9392-0

zbMATH Keywords

job sequencingoptimal schedulemakespan constraintssequential optimization algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• A note on minimizing maximum lateness in a one-machine sequencing problem with release dates
• A block approach for single-machine scheduling with release dates and due dates
• Certain properties of scheduling problems
• The one-machine sequencing problem
• Computer-Aided complexity classification of combinational problems
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Sequencing with due-dates and early start times to minimize maximum tardiness