Advanced search
Publication Cover
Journal of the Operational Research Society Volume 65, 2014 - Issue 1
Submit an article Journal homepage
35
Views
30
CrossRef citations to date
0
Altmetric
General Paper

Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents

B MorThe Department of Economics and Business AdministrationAriel University Center of SamariaIsrael
&
G MosheiovThe Hebrew UniversityJerusalemIsraelCorrespondence[email protected]
Pages 151-157 | Received 01 May 2012, Accepted 01 Jan 2013, Published online: 21 Dec 2017

Citations (30)

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

Danyu Bai, Ali Diabat, Xinyue Wang, Dandan Yang, Yao Fu, Zhi-Hai Zhang & Chin-Chia Wu. (2022) Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans. International Journal of Production Research 60:22, pages 6750-6771.
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. (2018) Minmax common due-window assignment and scheduling on a single machine with two competing agents. Journal of the Operational Research Society 69:4, pages 589-602.
Read now
Baruch Mor & Gur Mosheiov. (2016) Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society 67:12, pages 1524-1531.
Read now
Paz Perez-Gonzalez & Jose M. Framinan. (2015) Assessing scheduling policies in a permutation flowshop with common due dates. International Journal of Production Research 53:19, pages 5742-5754.
Read now
Baruch Mor & Gur Mosheiov. (2015) Minimizing the number of early jobs on a proportionate flowshop. Journal of the Operational Research Society 66:9, pages 1426-1429.
Read now

Articles from other publishers (24)

Peihai Liu, Manzhan Gu & Xiwen Lu. (2023) Two-agent scheduling in a two-machine open shop. Annals of Operations Research 333:1, pages 275-301.
Crossref
Jin Qian & Haiyan Han. (2021) Improved algorithms for proportionate flow shop scheduling with due-window assignment. Annals of Operations Research 309:1, pages 249-258.
Crossref
Abdennour Azerine, Mourad Boudhar & Djamal Rebaine. (2021) A two-machine no-wait flow shop problem with two competing agents. Journal of Combinatorial Optimization 43:1, pages 168-199.
Crossref
BongJoo Jeong, Jun-Hee Han & Ju-Yong Lee. (2021) Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times. Algorithms 14:11, pages 323.
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
Hongwei Li, Yuvraj Gajpal, Chirag Surti, Dongliang Cai & Amit Kumar Bhardwaj. (2020) Nature-Inspired Metaheuristics for Two-Agent Scheduling with Due Date and Release Time. Complexity 2020, pages 1-13.
Crossref
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
Baruch Mor & Dana Shapira. (2020) Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics 39:2.
Crossref
Yaping Fu, Hongfeng Wang, Guangdong Tian, Zhiwu Li & Hesuan Hu. (2018) Two-agent stochastic flow shop deteriorating scheduling via a hybrid multi-objective evolutionary algorithm. Journal of Intelligent Manufacturing 30:5, pages 2257-2272.
Crossref
Shesh Narayan Sahu, Yuvraj Gajpal & Swapan Debbarma. (2017) Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives. Annals of Operations Research 269:1-2, pages 623-640.
Crossref
Shi-Sheng Li, Ren-Xia Chen & Wen-Jie Li. (2017) Proportionate Flow Shop Scheduling with Multi-agents to Maximize Total Gains of JIT Jobs. Arabian Journal for Science and Engineering 43:2, pages 969-978.
Crossref
Byung-Gyoo Kim, Byung-Cheon Choi & Myoung-Ju Park. (2017) Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures. Asia-Pacific Journal of Operational Research 34:04, pages 1750017.
Crossref
Enrique Gerstl & Gur Mosheiov. (2017) Minmax weighted earliness-tardiness with identical processing times and two competing agents. Computers & Industrial Engineering 107, pages 171-177.
Crossref
Baruch Mor & Gur Mosheiov. (2016) A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. Journal of Combinatorial Optimization 33:4, pages 1454-1468.
Crossref
Mehdi Rajabi Asadabadi. (2017) A developed slope order index (SOI) for bottlenecks in projects and production lines. Computational Management Science 14:2, pages 281-291.
Crossref
BongJoo JEONG & Sang-Oh SHIM. (2017) Heuristic algorithms for two-machine re-entrant flowshop scheduling problem with jobs of two classes. Journal of Advanced Mechanical Design, Systems, and Manufacturing 11:5, pages JAMDSM0062-JAMDSM0062.
Crossref
Byung-Cheon Choi & Myoung-Ju Park. (2016) An Ordered Flow Shop with Two Agents. Asia-Pacific Journal of Operational Research 33:05, pages 1650037.
Crossref
Deming Lei & Ziyi Ai. (2016) Neighborhood search with memory and global exchange for three-agent job shop scheduling. Neighborhood search with memory and global exchange for three-agent job shop scheduling.
Deming Lei & Xiuping Guo. (2015) A shuffled frog-leaping algorithm for hybrid flow shop scheduling with two agents. Expert Systems with Applications 42:23, pages 9333-9339.
Crossref
S.S. Panwalkar & Christos Koulamas. (2015) On equivalence between the proportionate flow shop and single‐machine scheduling problems. Naval Research Logistics (NRL) 62:7, pages 595-603.
Crossref
Xiaoli Zhao & Gongshu Wang. (2015) Two-machine shop scheduling with two agents and linear deteriorating jobs. Two-machine shop scheduling with two agents and linear deteriorating jobs.
Deming Lei. (2015) Variable neighborhood search for two-agent flow shop scheduling problem. Computers & Industrial Engineering 80, pages 125-131.
Crossref
T.C.E. Cheng, Chih-Yu Liu, Wen-Chiung Lee & M. Ji. (2014) Two-agent single-machine scheduling to minimize the weighted sum of the agents’ objective functions. Computers & Industrial Engineering 78, pages 66-73.
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.