213
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Single CNC machine scheduling with controllable processing times and multiple due dates

&
Pages 6087-6111 | Received 01 Jan 2007, Published online: 09 Oct 2008

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

Read on this site (2)

Jeong-Hoon Shin, Jae-Min Yu, Hyoung-Ho Doh, Hyung-Won Kim & Dong-Ho Lee. (2020) Batching and scheduling for a single-machine flexible machining cell with multi-fixturing pallets and controllable processing times. International Journal of Production Research 58:3, pages 863-877.
Read now
Gang Li, Mei-Ling Luo, Wen-Jie Zhang & Xiao-Yuan Wang. (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. International Journal of Production Research 53:4, pages 1228-1241.
Read now

Articles from other publishers (11)

Ziye Zhao, Xiaohui Chen, Youjun An, Yinghe Li & Kaizhou Gao. (2023) A property-based hybrid genetic algorithm and tabu search for solving order acceptance and scheduling problem with trapezoidal penalty membership function. Expert Systems with Applications 218, pages 119598.
Crossref
Weihua Tan, Xiaofang Yuan, Yuhui Yang & Lianghong Wu. (2022) Multi-objective casting production scheduling problem by a neighborhood structure enhanced discrete NSGA-II: an application from real-world workshop. Soft Computing 26:17, pages 8911-8928.
Crossref
Ziye Zhao, Xiaohui Chen, Youjun An & Yinghe Li. (2022) A property-based genetic algorithm for order acceptance and scheduling with common due window. IFAC-PapersOnLine 55:10, pages 1219-1224.
Crossref
Simon Thevenin & Nicolas Zufferey. (2019) Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections. Discrete Applied Mathematics 261, pages 344-353.
Crossref
Jenny Díaz Ramírez, Jose Ignacio Huertas & Jose Ignacio Huertas. (2018) A continuous time model for a short-term multiproduct batch process scheduling. Ingeniería e Investigación 38:1, pages 96-104.
Crossref
Nicolas Zufferey & Olivier Gallay. 2018. Bioinspired Optimization Methods and Their Applications. Bioinspired Optimization Methods and Their Applications 320 332 .
Simon Thevenin, Nicolas Zufferey & Marino Widmer. (2016) Order acceptance and scheduling with earliness and tardiness penalties. Journal of Heuristics 22:6, pages 849-890.
Crossref
Mohammed Al-Salem, Leonardo Bedoya-Valencia & Ghaith Rabadi. (2016) Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem. Mathematical Problems in Engineering 2016, pages 1-11.
Crossref
Hadi Mokhtari. (2014) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Computing and Applications 26:5, pages 1085-1101.
Crossref
Vahid Kayvanfar, Iraj Mahdavi & GH.M. Komaki. (2013) Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering 65:1, pages 166-175.
Crossref
Hong-an Yang, Qi-feng Sun, Can Saygin & Shu-dong Sun. (2011) Job shop scheduling based on earliness and tardiness penalties with due dates and deadlines: an enhanced genetic algorithm. The International Journal of Advanced Manufacturing Technology 61:5-8, pages 657-666.
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.