Advanced search
Publication Cover
International Journal of Production Research Volume 57, 2019 - Issue 2
Submit an article Journal homepage
379
Views
20
CrossRef citations to date
0
Altmetric
Articles

Scheduling on a proportionate flowshop to minimise total late work

Enrique GerstlSchool of Business Administration, The Hebrew University, Jerusalem, Israel;School of Industrial Engineering, Jerusalem College of Technology, Jerusalem, IsraelView further author information
,
Baruch MorDepartment of Economics and Business Administration, Ariel University, Ariel, IsraelORCID Iconhttp://orcid.org/0000-0002-6909-8160View further author information
ORCID Icon &
Gur MosheiovSchool of Business Administration, The Hebrew University, Jerusalem, IsraelCorrespondence[email protected]
View further author information
Pages 531-543 | Received 05 Feb 2017, Accepted 09 Mar 2018, Published online: 03 Apr 2018

Citations (20)

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)

Rubing Chen, Yuan Gao, Zhichao Geng & Jinjiang Yuan. (2023) Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work. International Journal of Production Research 61:22, pages 7630-7648.
Read now
Baruch Mor & Dana Shapira. (2022) Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops. Journal of the Operational Research Society 73:7, pages 1499-1516.
Read now
Baruch Mor & Dana Shapira. (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society 70:11, pages 1997-2003.
Read now

Articles from other publishers (17)

Dvir Shabtay. (2022) A new perspective on single-machine scheduling problems with late work related criteria. Annals of Operations Research 322:2, pages 947-966.
Crossref
Rubing Chen, Zhichao Geng, Lingfa Lu, Jinjiang Yuan & Yuan Zhang. (2022) Pareto-scheduling of two competing agents with their own equal processing times. European Journal of Operational Research 301:2, pages 414-431.
Crossref
Xin Chen, Qian Miao, Bertrand M.T. Lin, Malgorzata Sterna & Jacek Blazewicz. (2022) Two-machine flow shop scheduling with a common due date to maximize total early work. European Journal of Operational Research 300:2, pages 504-511.
Crossref
Baruch Mor & Dvir Shabtay. (2022) Single-machine scheduling with total late work and job rejection. Computers & Industrial Engineering 169, pages 108168.
Crossref
Zhuoran Dong, Tao Ren, Jiacheng Weng, Fang Qi & Xinyue Wang. (2022) Minimizing the Late Work of the Flow Shop Scheduling Problem with a Deep Reinforcement Learning Based Approach. Applied Sciences 12:5, pages 2366.
Crossref
Małgorzata Sterna. (2021) Late and early work scheduling: A survey. Omega 104, pages 102453.
Crossref
Xingong Zhang. (2021) Two competitive agents to minimize the weighted total late work and the total completion time. Applied Mathematics and Computation 406, pages 126286.
Crossref
Gur Mosheiov, Daniel Oron & Dvir Shabtay. (2021) Minimizing total late work on a single machine with generalized due-dates. European Journal of Operational Research 293:3, pages 837-846.
Crossref
David Freud & Gur Mosheiov. (2021) Scheduling with competing agents, total late work and job rejection. Computers & Operations Research 133, pages 105329.
Crossref
Ren-Xia Chen & Shi-Sheng Li. (2020) Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs. Asia-Pacific Journal of Operational Research 38:02, pages 2050046.
Crossref
Gur Mosheiov & Daniel Oron. (2021) A note on scheduling a rate modifying activity to minimize total late work. Computers & Industrial Engineering 154, pages 107138.
Crossref
Baruch Mor, Dvir Shabtay & Liron Yedidsion. (2021) Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times. Computers & Industrial Engineering 153, pages 107024.
Crossref
Xin Chen, Sergey Kovalev, Yuqing Liu, Małgorzata Sterna, Isabelle Chalamon & Jacek Błażewicz. (2021) Semi-online scheduling on two identical machines with a common due date to maximize total early work. Discrete Applied Mathematics 290, pages 71-78.
Crossref
Shi-Sheng Li & Jin-Jiang Yuan. (2020) Single-machine scheduling with multi-agents to minimize total weighted late work. Journal of Scheduling 23:4, pages 497-512.
Crossref
Christos Koulamas. (2020) The proportionate flow shop total tardiness problem. European Journal of Operational Research 284:2, pages 439-444.
Crossref
Xin Chen, Yage Liang, Małgorzata Sterna, Wen Wang & Jacek Błażewicz. (2020) Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date. European Journal of Operational Research 284:1, pages 67-74.
Crossref
Baruch Mor & Dana Shapira. (2020) Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics 39:2.
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.