Advanced search
Publication Cover
International Journal of Production Research Volume 55, 2017 - Issue 6
Submit an article Journal homepage
344
Views
11
CrossRef citations to date
0
Altmetric
Original Articles

Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window

Kuo-Ching YingDepartment of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
,
Shih-Wei LinDepartment of Information Management, Chang Gung University, Taoyuan, Taiwan;Department of Neurology, Linkou Chang Gung Memorial Hospital, Taoyuan, Taiwan;Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei City, Taiwan
&
Chung-Cheng LuDepartment of Transportation and Logistics Management, National Chiao Tung University, Taipei, TaiwanCorrespondence[email protected]
Pages 1707-1719 | Received 13 Oct 2015, Accepted 09 Aug 2016, Published online: 24 Aug 2016

Citations (11)

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)

Shan Wang, Huiqiao Su, Guohua Wan & Liwei Zhong. (2023) Surgery scheduling in the presence of operating room eligibility and dedicated surgeon: an adaptive composite dispatching method. International Journal of Production Research 61:6, pages 1866-1881.
Read now
Enrique Gerstl & Gur Mosheiov. (2021) The single machine CON problem with unavailability period. International Journal of Production Research 59:3, pages 824-838.
Read now

Articles from other publishers (9)

Bin Zhang & Cheng-Hung Wu. (2023) Joint Dynamic Dispatching and Preventive Maintenance for Unrelated Parallel Machines With Equipment Health Considerations. IEEE Transactions on Semiconductor Manufacturing 36:4, pages 578-589.
Crossref
Gustavo Alencar Rolim, Marcelo Seido Nagano & Bruno de Athayde Prata. (2023) Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers & Operations Research 153, pages 106159.
Crossref
Yujing Jiang, Zhe Zhang, Xiaoling Song & Yong Yin. (2022) Seru Scheduling Problems with Multiple Due-Windows Assignment and Learning Effect. Journal of Systems Science and Systems Engineering 31:4, pages 480-511.
Crossref
Gustavo Alencar Rolim, Marcelo Seido Nagano & Bruno de Athayde Prata. (2021) Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows. Arabian Journal for Science and Engineering 47:3, pages 3899-3913.
Crossref
Gustavo Alencar Rolim & Marcelo Seido Nagano. (2020) Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Computers & Industrial Engineering 149, pages 106803.
Crossref
Ghiath Al Aqel, Xinyu Li & Liang Gao. (2019) A Modified Iterated Greedy Algorithm for Flexible Job Shop Scheduling Problem. Chinese Journal of Mechanical Engineering 32:1.
Crossref
Shih-Wei Lin, Kuo-Ching Ying, Wen-Jie Wu & Chen-Yang Cheng. (2019) Single Machine Job Sequencing With a Restricted Common Due Window. IEEE Access 7, pages 148741-148755.
Crossref
Yong Zhou, Jian-Jun Yang & Lian-Yu Zheng. (2019) Multi-Agent Based Hyper-Heuristics for Multi-Objective Flexible Job Shop Scheduling: A Case Study in an Aero-Engine Blade Manufacturing Plant. IEEE Access 7, pages 21147-21176.
Crossref
John N. Hooker. 2019. Principles and Practice of Constraint Programming. Principles and Practice of Constraint Programming 268 283 .

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.