Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal semi-online algorithm for 2-machine scheduling with an availability constraint

From MaRDI portal
Publication:719024
Jump to:navigation, search

DOI10.1007/s10878-009-9280-3zbMath1226.90038OpenAlexW1985841699MaRDI QIDQ719024

Chunjie Su, Hong-Ying Li

Publication date: 27 September 2011

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9280-3


zbMATH Keywords

algorithmschedulingcompetitive ratioavailabilitysemi-online


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (1)

Online and semi-online scheduling to minimize makespan on single machine with an availability constraint



Cites Work

  • Semi on-line scheduling on two identical machines
  • Parallel machines scheduling with machine shutdowns
  • Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
  • Scheduling with limited machine availability




This page was built for publication: An optimal semi-online algorithm for 2-machine scheduling with an availability constraint

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:719024&oldid=12638384"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki