Journal ArticleOPEN ACCESS

A BEST POSSIBLE ALGORITHM FOR AN ONLINE SCHEDULING PROBLEM WITH POSITION-BASED LEARNING EFFECT

Journal of Industrial and Management Optimization (2022) 18(6) 3989-4010
DOI: 10.3934/jimo.2021144
0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we focus on an online scheduling problem with position-based learning effect on a single machine, where the jobs are released online over time and preemption is not allowed. The information about each job Jj, including the basic processing time pj and the release time rj, is only available when it arrives. The actual processing time p′

Author supplied keywords

Cite

CITATION STYLE

APA

Ma, R., Zhang, L., & Zhang, Y. (2022). A BEST POSSIBLE ALGORITHM FOR AN ONLINE SCHEDULING PROBLEM WITH POSITION-BASED LEARNING EFFECT. Journal of Industrial and Management Optimization, 18(6), 3989–4010. https://doi.org/10.3934/jimo.2021144

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free