Single machine scheduling problems with subcontracting options

DOI10.1007/S10878-011-9442-YzbMATH Open1282.90079OpenAlexW2025876912MaRDI QIDQ385484FDOQ385484

Wei-ya Zhong, Zhiming Huo

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 complexityschedulingsubcontracting

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

Cited In (5)

• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Fixed interval scheduling with third‐party machines
• Scheduling of two-machine flowshop with outsourcing lead-time
• Title not available (Why is that?)
• Outsourcing and scheduling for a two-machine flow shop with release times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385484)