The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect

Jin Qian and Yu Zhan
Additional contact information
Jin Qian: College of Science, Northeastern University, Shenyang 110819, China
Yu Zhan: College of Science, Northeastern University, Shenyang 110819, China

Mathematics, 2021, vol. 9, issue 23, 1-14

Abstract: This paper considers a single-machine scheduling problem with past-sequence-dependent delivery times and the truncated sum-of-processing-times-based learning effect. The goal is to minimize the total costs that comprise the number of early jobs, the number of tardy jobs and due date. The due date is a decision variable. There will be corresponding penalties for jobs that are not completed on time. Under the common due date, slack due date and different due date, we prove that these problems are polynomial time solvable. Three polynomial time algorithms are proposed to obtain the optimal sequence.

Keywords: scheduling; delivery times; learning effect; common due date; slack due date; different due date (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/23/3085/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/23/3085/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2021:i:23:p:3085-:d:691679

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().