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

Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs

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

DOI10.1023/A:1018974428912zbMath0931.90019MaRDI QIDQ1960313

Chris N. Potts, A. M. A. Hariri, Jatinder N. D. Gupta

Publication date: 11 January 2000

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


zbMATH Keywords

single-machine schedulingbranch and bound algorithmmaximum tardinesstardy jobs


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)


Related Items (3)

A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Fuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness ⋮ Multicriteria scheduling




This page was built for publication: Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs

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