Advanced search
Publication Cover
Journal of the Operational Research Society Volume 48, 1997 - Issue 2
Submit an article Journal homepage
11
Views
14
CrossRef citations to date
0
Altmetric
Technical Note

Two-machine flowshop scheduling to minimize the number of tardy jobs

J N D GuptaBall State UniversityUSA
&
A M A HaririKing Abdul Aziz UniversitySaudi Arabia
Pages 212-220 | Received 01 Mar 1996, Accepted 01 Aug 1996, Published online: 20 Dec 2017

Citations (14)

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 (2)

Ali Allahverdi, Asiye Aydilek & Harun Aydilek. (2016) Minimizing the number of tardy jobs on a two-stage assembly flowshop. Journal of Industrial and Production Engineering 33:6, pages 391-403.
Read now
Ching-Fang Liaw & An-Hsiang Lin. (2001) SCHEDULING OPEN SHOPS TO MINIMIZE TOTAL WEIGHTED TARDINESS. Journal of the Chinese Institute of Industrial Engineers 18:6, pages 29-42.
Read now

Articles from other publishers (12)

Harpreet Singh, Jaspreet Singh Oberoi & Doordarshi Singh. (2021) Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: a systematic literature review. RAIRO - Operations Research 55:1, pages 27-50.
Crossref
Wojciech Bożejko, Paweł Rajba & Mieczysław Wodecki. 2021. 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020). 15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020) 289 298 .
BongJoo Jeong, Yeong‐Dae Kim & Sang‐Oh Shim. (2018) Algorithms for a two‐machine flowshop problem with jobs of two classes. International Transactions in Operational Research 27:6, pages 3123-3143.
Crossref
Muminu O. Adamu & Aderemi O. Adewumi. (2016) Minimizing the weighted number of tardy jobs on multiple machines: A review. Journal of Industrial and Management Optimization 12:4, pages 1465-1493.
Crossref
Arezoo Jafari & Ali Elyasi. (2015) Minimizing the number of tardy jobs in a dynamic flexible flow shop. Minimizing the number of tardy jobs in a dynamic flexible flow shop.
Morteza Rasti-Barzoki, Seyed Reza Hejazi & Mohammad Mahdavi Mazdeh. (2013) A Branch and Bound Algorithm to Minimize the Total Weighed Number of Tardy Jobs and Delivery Costs. Applied Mathematical Modelling 37:7, pages 4924-4937.
Crossref
S.S. Panwalkar & Christos Koulamas. (2012) An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines. European Journal of Operational Research 221:1, pages 7-13.
Crossref
Vincent T’kindt, Federico Della Croce & Jean-Louis Bouquard. (2007) Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. INFORMS Journal on Computing 19:1, pages 64-72.
Crossref
R.L. Bulfin & Rym M'Hallah. (2003) Minimizing the weighted number of tardy jobs on a two-machine flow shop. Computers & Operations Research 30:12, pages 1887-1900.
Crossref
V. Gordon, G. Finke & J.-M. Proth. (2002) Scheduling with due dates and deadlines. Scheduling with due dates and deadlines.
Bertrand M.T. Lin. (2001) Scheduling in the two-machine flowshop with due date constraints. International Journal of Production Economics 70:2, pages 117-123.
Crossref
Federico Della Croce, Jatinder N.D Gupta & Roberto Tadei. (2000) Minimizing tardy jobs in a flowshop with common due date. European Journal of Operational Research 120:2, pages 375-381.
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.