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 algorithms based on necessary optimality conditions

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

DOI10.1007/BF01095175zbMath0665.90049MaRDI QIDQ1116885

Alexander A. Lazarev

Publication date: 1989

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)


zbMATH Keywords

necessary conditions of optimalityone machine


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Optimality conditions (49K99)




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
  • One - processor scheduling with nonuniform ready times
  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey


This page was built for publication: Scheduling algorithms based on necessary optimality conditions

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