Skip to search formSkip to main contentSkip to account menu

Tardiness (scheduling)

Known as: Earliness (scheduling), Lateness (scheduling) 
In scheduling, tardiness is a measure of a delay in executing certain operations and earliness is a measure of finishing operations before due time… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (2)

Operations researchTheoretical computer science
Single-machine scheduling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Production, takt and lead time variation: Production planning and tardiness probabilities in small-lot production
This paper describes the production planning and control processes of two companies, which interact closely in the maritime… 
2012
2012
David Bellos (ed): Is that a fish in your ear: translation and the meaning of everything
2012
2012
Just-in-Time Scheduling with Equal-Size Jobs
This chapter deals with common due date scheduling problem on single and parallel machines in which job processing times are… 
2010
2010
Notice of RetractionA hybrid collaborative evolutionary method for Job Shop scheduling with parallel machines
In order to solve the problem of Job Shop scheduling with parallel machines considering energy consumption, an optimization model… 
2009
2009
Earliness/Tardiness Scheduling Problem With The Past Sequence Dependent Setup Times Under Combinations Of Effects Of Learning And Deterioration
Bu makale iki ogrenme etkisi ve iki bozulma etkisinin ortak dort kombinasyonu altinda gecmis sira bagimli hazirlik zamanli Erken… 
2008
2008
Scheduling with earliness–tardiness penalties and parallel machines
This is a summary of the author’s PhD thesis supervised by Francis Sourd and Philippe Chrétienne and defended on 30 January 2007… 
2007
2007
DEFICIT IRRIGATION SCHEDULES TO PROMOTE EARLY FLOWERING IN 'ALGERIE' LOQUAT
Deficit irrigation initiated 8 weeks after harvest has been proven to be a suitable and more profitable strategy for producing… 
2006
2006
A reinforced Lagrangean relaxation for non-preemptive single machine problem
The time-indexed formulation [3, 6] is a well-known way to formulate a singlemachine scheduling problem as a mixed-integer… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)