Job shop scheduling with unit length tasks

DOI10.1051/ita/2011132zbMath1283.68158OpenAlexW2085269837MaRDI QIDQ2905324

Raphael Bernhard, M. E. Akveld

Publication date: 27 August 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2012__46_3_329_0/

zbMATH Keywords

job shop schedulingcompetitive analysisonline algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic scheduling theory in operations research (90B36) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Advice Complexity of Fine-Grained Job Shop Scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient algorithm for the job-shop problem with two jobs
• On the Advice Complexity of Online Problems
• Advice Complexity and Barely Random Algorithms

This page was built for publication: Job shop scheduling with unit length tasks