Advanced search
Publication Cover
Journal of the Operational Research Society Volume 54, 2003 - Issue 6
Submit an article Journal homepage
24
Views
8
CrossRef citations to date
0
Altmetric
Technical Note

Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed

M AzizogluMiddle East Technical UniversityAnkaraTurkeyCorrespondence[email protected]
,
M KoksalanMiddle East Technical UniversityAnkaraTurkey;Purdue University, West LafayetteINUSACorrespondence[email protected]
&
S K KoksalanMiddle East Technical UniversityAnkaraTurkey;Purdue University, West LafayetteINUSA
Pages 661-664 | Received 01 Feb 2001, Accepted 01 Jul 2002, Published online: 21 Dec 2017

Citations (8)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (3)

R-H Huang & C-L Yang. (2009) An algorithm for minimizing flow time and maximum earliness on a single machine. Journal of the Operational Research Society 60:6, pages 873-877.
Read now
C Gagné, M Gravel & W L Price. (2005) Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. Journal of the Operational Research Society 56:6, pages 687-698.
Read now
J N D Gupta, A J Ruiz-torres & S Webster. (2003) Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time. Journal of the Operational Research Society 54:12, pages 1263-1274.
Read now

Articles from other publishers (5)

Federico Della Croce. (2015) MP or not MP: that is the question. Journal of Scheduling 19:1, pages 33-42.
Crossref
Muminu O. Adamu & Aderemi O. Adewumi. (2014) A survey of single machine scheduling to minimize weighted number of tardy jobs. Journal of Industrial & Management Optimization 10:1, pages 219-241.
Crossref
Jaehwan Yang. (2013) No Tardiness Rescheduling with Order Disruptions. Industrial Engineering and Management Systems 12:1, pages 51-62.
Crossref
Ehsan Molaee, Ghasem Moslehi & Mohammad Reisi. (2010) Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. Computers & Mathematics with Applications 60:11, pages 2909-2919.
Crossref
Guohua Wan & Benjamin P.-C. Yen. (2009) Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs. European Journal of Operational Research 195:1, pages 89-97.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.