Advanced search
Publication Cover
Journal of the Operational Research Society Volume 70, 2019 - Issue 11
Submit an article Journal homepage
167
Views
19
CrossRef citations to date
0
Altmetric
Original Articles

Improved algorithms for scheduling on proportionate flowshop with job-rejection

Baruch MorDepartment of Economics and Business Administration, Ariel University, Ariel, Israel;
&
Dana ShapiraDepartment of Computer Science, Ariel University, Ariel, IsraelCorrespondence[email protected]
Pages 1997-2003 | Received 19 Sep 2017, Accepted 12 Jul 2018, Published online: 20 Jan 2019

Citations (19)

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)

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. (2020) Scheduling with regular performance measures and optional job rejection on a single machine. Journal of the Operational Research Society 71:8, pages 1315-1325.
Read now

Articles from other publishers (17)

Matan Atsmony & Gur Mosheiov. (2024) Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection. Optimization Letters 18:3, pages 751-766.
Crossref
Ren-Xia Chen & Shi-Sheng Li. (2023) Two-machine job shop scheduling with optional job rejection. Optimization Letters.
Crossref
Matan Atsmony & Gur Mosheiov. (2022) Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection. Journal of Scheduling 26:2, pages 193-207.
Crossref
Baruch Mor. (2023) Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection. Operational Research 23:1.
Crossref
Matan Atsmony & Gur Mosheiov. (2022) A Greedy heuristic for solving scheduling problems with bounded rejection cost. Computers & Operations Research 144, pages 105827.
Crossref
Baruch Mor & Dana Shapira. (2022) Single machine scheduling with non-availability interval and optional job rejection. Journal of Combinatorial Optimization 44:1, pages 480-497.
Crossref
Baruch Mor & Dvir Shabtay. (2022) Single-machine scheduling with total late work and job rejection. Computers & Industrial Engineering 169, pages 108168.
Crossref
Baruch Mor & Gur Mosheiov. (2021) Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection. Operational Research 22:3, pages 2707-2719.
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
Xiaojuan Jiang, An Zhang, Yong Chen, Guangting Chen & Kangbok Lee. (2021) An improved algorithm for a two-stage production scheduling problem with an outsourcing option. Theoretical Computer Science 876, pages 59-69.
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
Baruch Mor & Gur Mosheiov. (2020) A note: flowshop scheduling with linear deterioration and job-rejection. 4OR 19:1, pages 103-111.
Crossref
Baruch Mor, Gur Mosheiov & Dana Shapira. (2020) Single machine lot scheduling with optional job-rejection. Journal of Combinatorial Optimization 41:1, pages 1-11.
Crossref
Baruch Mor, Gur Mosheiov & Dana Shapira. (2019) Flowshop scheduling with learning effect and job rejection. Journal of Scheduling 23:6, pages 631-641.
Crossref
Baruch Mor & Dana Shapira. (2020) Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics 39:2.
Crossref
Baruch Mor. (2018) Minmax scheduling problems with common due-date and completion time penalty. Journal of Combinatorial Optimization 38:1, pages 50-71.
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.