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

Scheduling with Finite Capacity Input Buffers

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

DOI10.1287/opre.46.3.S154zbMath0987.90038MaRDI QIDQ2781130

Marc E. Posner, Chris N. Potts, Nicholas G. Hall

Publication date: 18 March 2002

Published in: Operations Research (Search for Journal in Brave)



Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (4)

A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ Multi-objective master production scheduling in make-to-order manufacturing ⋮ Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers ⋮ A cyclic versus flexible approach to materials ordering in make-to-order assembly




This page was built for publication: Scheduling with Finite Capacity Input Buffers

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