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

Unbounded serial-batching scheduling on hierarchical optimization

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

DOI10.1007/S40305-020-00334-5zbMath1488.90050OpenAlexW3119360282MaRDI QIDQ2059199

Cheng He, Hao Lin, Li Li

Publication date: 13 December 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-020-00334-5


zbMATH Keywords

hierarchical schedulingmaximum costserial-batching


Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)





Cites Work

  • Unnamed Item
  • Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
  • Spectral properties of the matrix splitting preconditioners for generalized saddle point problems
  • Bounded serial-batching scheduling for minimizing maximum lateness and makespan
  • Multicriteria scheduling
  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
  • Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
  • Optimal Sequencing of a Single Machine Subject to Precedence Constraints




This page was built for publication: Unbounded serial-batching scheduling on hierarchical optimization

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