Single machine scheduling problems with subcontracting options

DOI10.1007/S10878-011-9442-YzbMath1282.90079OpenAlexW2025876912MaRDI QIDQ385484

Zhiming Huo, Wei-ya Zhong

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9442-y

zbMATH Keywords

computational complexitysubcontractingscheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Outsourcing and scheduling for a two-machine flow shop with release times ⋮ Scheduling of two-machine flowshop with outsourcing lead-time ⋮ Fixed interval scheduling with third‐party machines ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item

This page was built for publication: Single machine scheduling problems with subcontracting options