Single-machine scheduling with supporting tasks

DOI10.1016/j.disopt.2015.05.001zbMath1387.90091OpenAlexW816055510MaRDI QIDQ1751119

Alexander V. Kononov, Kuei-Tang Fang, Bertrand M. T. Lin

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2015.05.001

zbMATH Keywords

single-machine schedulingtotal weighted completion timenumber of late jobssupporting precedence

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
• Complexity results for scheduling chains on a single machine
• Complexity of Scheduling under Precedence Constraints
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• The open shop scheduling problem with a given sequence of jobs on one machine
• Reducibility among Combinatorial Problems
• Optimal Linear Ordering
• Algorithms – ESA 2005
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
• The dense \(k\)-subgraph problem