Advanced search
Publication Cover
Engineering Optimization Volume 49, 2017 - Issue 6
Submit an article Journal homepage
180
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Common due date assignment and cumulative deterioration scheduling on a single machine

Shi-Sheng LiDepartment of Information and Computation Science, Zhongyuan University of Technology, Zhengzhou, PR ChinaCorrespondence[email protected]
View further author information
&
Ren-Xia ChenDepartment of Information and Computation Science, Zhongyuan University of Technology, Zhengzhou, PR ChinaView further author information
Pages 976-989 | Received 05 Jun 2016, Accepted 11 Aug 2016, Published online: 23 Sep 2016

Citations (13)

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

Gur Mosheiov & Sharon Pruwer. (2021) On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops. Engineering Optimization 53:3, pages 408-424.
Read now
Mengzhuo Bai & Yufang Zhao. (2020) A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint. Engineering Optimization 52:8, pages 1313-1322.
Read now
Chuanli Zhao & Chou-Jung Hsu. (2019) Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs. Engineering Optimization 51:11, pages 1938-1943.
Read now

Articles from other publishers (10)

Qinyu Jin, Shuai Zhang, Jiyuan Xu, Kang Jiang, Yuanzhe Cheng & Wenyu Zhang. (2023) Remanufacturing System Scheduling of Batch Products with the Consideration of Dynamic Changes in Machine Efficiency Using an Improved Artificial Bee Colony Algorithm. Computers & Industrial Engineering, pages 109817.
Crossref
Dvir Shabtay. (2022) A new perspective on single-machine scheduling problems with late work related criteria. Annals of Operations Research 322:2, pages 947-966.
Crossref
Jin Qian & Haiyan Han. (2021) The due date assignment scheduling problem with the deteriorating jobs and delivery time. Journal of Applied Mathematics and Computing 68:4, pages 2173-2186.
Crossref
Wen-Tso Huang, Ping-Shun Chen, Gary Yu-Hsin Chen & Jr-Fong Dang. (2022) The Dynamic Flow Shop Scheduling Problem with JIT Philosophy and Common Due Date. Mathematical Problems in Engineering 2022, pages 1-12.
Crossref
Maziar Yazdani, Kamyar Kabirifar, Amir M. Fathollahi-Fard & Mohammad Mojtahedi. (2021) Production scheduling of off-site prefabricated construction components considering sequence dependent due dates. Environmental Science and Pollution Research.
Crossref
Mehdi Abedi, Raymond Chiong, Nasimul Noman & Rui Zhang. (2020) A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines. Expert Systems with Applications 157, pages 113348.
Crossref
Shi-Sheng Li, Ren-Xia Chen, Qi Feng & Cheng-Wen Jiao. (2019) Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection. Journal of Combinatorial Optimization 38:3, pages 957-971.
Crossref
Cemal AKTÜRK & Sevinç GÜLSEÇEN. (2019) DETERMINING ORDER DELIVERY DATE BY REVENUE APPROACH: A CASE STUDY WITH NONWOVEN TEXTILE MANUFACTURERS IN TRC1 REGION. Tekstil ve Konfeksiyon 29:2, pages 133-141.
Crossref
Ren-Xia Chen & Shi-Sheng Li. (2018) Two-agent single-machine scheduling with cumulative deterioration. 4OR 17:2, pages 201-219.
Crossref
Mehdi Abedi, Raymond Chiong, Nasimul Noman & Rui Zhang. (2017) A hybrid particle swarm optimisation approach for energy-efficient single machine scheduling with cumulative deterioration and multiple maintenances. A hybrid particle swarm optimisation approach for energy-efficient single machine scheduling with cumulative deterioration and multiple maintenances.

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.