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

Online Scheduling with Lookahead: Multipass Assembly Lines

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

DOI10.1287/ijoc.10.3.331zbMath1092.90518OpenAlexW2170208937MaRDI QIDQ4427353

Vijay Saraswat, Eric Torng, Rajeev Motwani

Publication date: 16 December 2003

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9872957cb3248516ec4be9b967136e7b22b0d205



Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (4)

On the power of lookahead in online lot-sizing ⋮ Online packet scheduling with bounded delay and lookahead ⋮ The Bursty Steiner Tree Problem ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead




This page was built for publication: Online Scheduling with Lookahead: Multipass Assembly Lines

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