Tri-criteria single machine scheduling model with release times and learning factor

Jin Qian, Hexiang Lin, Yufeng Kong and Yuansong Wang

Applied Mathematics and Computation, 2020, vol. 387, issue C

Abstract: In this paper, we consider the single machine scheduling problem with release times and a learning effect. The actual processing time of a job is a function that is the total processing time of the jobs already processed. The objective is to minimize the weighted sum of makespan, total completion time and maximum tardiness. This problem is NP-hard, some heuristic algorithms and branch-and-bound algorithm based on the Depth-first Search algorithm are proposed to solve the problem. Computational experiments are conducted to evaluate the performance of the heuristic and branch-and-bound algorithms.

Keywords: Scheduling; Release time; Learning effect; Algorithm (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319305260
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:387:y:2020:i:c:s0096300319305260

DOI: 10.1016/j.amc.2019.06.057

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().