Abstract
In this paper the one- machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed. A n algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal.
| Original language | English |
|---|---|
| Pages (from-to) | 226-230 |
| Number of pages | 5 |
| Journal | Production Planning and Control |
| Volume | 8 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Jan 1997 |
Bibliographical note
Funding Information:Partofthiswokwrascrriaedoutdrinugthe® rst autho’s sarbbatical leave. The authors would like to acknowledge the support of King Fahd Unversiity of Petroleum and Minealsr, Dahrahn, Saudi Arabia.
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Mean tardiness
- Number of tardy jobs
- Single machine scheduling
ASJC Scopus subject areas
- Computer Science Applications
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
Fingerprint
Dive into the research topics of 'One-machine scheduling to minimize mean tardiness with minimum number tardy'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver