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 lots of dependent unit-time operations on identical machines to minimize schedule length

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

DOI10.1016/0377-2217(85)90129-8zbMath0572.90052OpenAlexW1968233780MaRDI QIDQ1062615

Tadeusz J. Sawik

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90129-8


zbMATH Keywords

production schedulingparallel machinespolynomial-time algorithmidentical machinesminimum lengthunit-time operations


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)


Related Items (2)

Modelling and scheduling a batch-type production on identical machines ⋮ Level scheduling to minimize schedule length on lots of unit-time jobs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Scheduling multi-operational tasks on nonidentical machines as a time- optimal control problem
  • Elementary Proof of Hu's Theorem on Isotone Mappings




This page was built for publication: Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1062615&oldid=13079215"
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 23:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki