27
Views
15
CrossRef citations to date
0
Altmetric
General Paper

Minmax scheduling problems with common flow-allowance

&
Pages 1284-1293 | Received 01 Mar 2011, Accepted 01 Sep 2011, Published online: 21 Dec 2017

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

Read on this site (2)

Baruch Mor. (2021) Single-machine lot scheduling with variable lot processing times. Engineering Optimization 53:2, pages 321-334.
Read now

Articles from other publishers (13)

Dan-Yang Lv, Jing Xue & Ji-Bo Wang. (2023) Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs. Journal of the Operations Research Society of China.
Crossref
Baruch Mor. (2021) Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads. Journal of Combinatorial Optimization 43:1, pages 79-97.
Crossref
Baruch Mor & Gur Mosheiov. (2021) Minmax due-date assignment on a two-machine flowshop. Annals of Operations Research 305:1-2, pages 191-209.
Crossref
Qing Yue & Shenghai Zhou. (2021) Due-window assignment scheduling problem with stochastic processing times. European Journal of Operational Research 290:2, pages 453-468.
Crossref
Baruch Mor. (2020) A unified approach for single machine scheduling with position-dependent workloads and positional penalties. SN Applied Sciences 2:2.
Crossref
成新 罗. (2020) Minmax Single Machine Scheduling Problem with Common Due-Date and Controllable Processing Time and Resource Restriction. Advances in Applied Mathematics 09:11, pages 1945-1953.
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
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
Baruch Mor & Gur Mosheiov. (2016) Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. European Journal of Operational Research 254:2, pages 360-370.
Crossref
Min Ji, Danli Yao, Qinyun Yang & T.C.E. Cheng. (2014) Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity. International Transactions in Operational Research 22:6, pages 997-1015.
Crossref
Junxiang Li, Mingsong Cheng, Bo Yu & Shuting Zhang. (2014) Group Update Method for Sparse Minimax Problems. Journal of Optimization Theory and Applications 166:1, pages 257-277.
Crossref
Adam Janiak, Władysław A. Janiak, Tomasz Krysiak & Tomasz Kwiatkowski. (2015) A survey on scheduling problems with due windows. European Journal of Operational Research 242:2, pages 347-357.
Crossref
Junxiang Li, Yan Gao, Tao Dai, Chunming Ye, Qiang Su & Jiazhen Huo. (2013) Substitution secant/finite difference method to large sparse minimax problems. Journal of Industrial and Management Optimization 10:2, pages 637-663.
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:

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:

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.