Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times

Zheng Liu and Ji-Bo Wang ()
Additional contact information
Zheng Liu: School of Economics and Management, Shenyang Aerospace University, Shenyang 110136, China
Ji-Bo Wang: School of Economics and Management, Shenyang Aerospace University, Shenyang 110136, China

Mathematics, 2024, vol. 12, issue 16, 1-20

Abstract: This paper studies the single-machine scheduling problem with truncated learning effect, time-dependent processing time, and past-sequence-dependent delivery time. The delivery time is the time that the job is delivered to the customer after processing is complete. The goal is to determine an optimal job schedule to minimize the total weighted completion time and maximum tardiness. In order to solve the general situation of the problem, we propose a branch-and-bound algorithm and other heuristic algorithms. Computational experiments also prove the effectiveness of the given algorithms.

Keywords: scheduling; learning effect; delivery time; heuristic algorithm; branch-and-bound algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
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/12/16/2522/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/16/2522/ (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:12:y:2024:i:16:p:2522-:d:1457081

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