Online Machine Scheduling with Family Setups

DOI10.1142/S0217595916500275zbMath1348.90335OpenAlexW2480376607MaRDI QIDQ2821094

Andrew Wirth, LeLe Zhang

Publication date: 16 September 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500275

zbMATH Keywords

single machineonline schedulingfamily setup

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On competitive analysis for polling systems

Cites Work

• Unnamed Item
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• A survey of scheduling problems with setup times or costs
• Approximation algorithms for problems in scheduling with set-ups

This page was built for publication: Online Machine Scheduling with Family Setups