Single-machine scheduling with times-based and job-dependent learning effect

Jiang, Zhongyi; Chen, Fangfang; Zhang, Xiandong

doi:10.1057/jors.2016.40

Cited by 7 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many scholars engaged in one-processor scheduling and parallel-processor scheduling research in the early stage [4][5][6][7][8], and many scholars are continuing research in this field [9][10][11][12][13][14][15]. Luo et al [16] studied the single-machine scheduling problem with job-dependent machine deterioration.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Constraint (8) indicates that decision variable X ij is an integer of 0 or 1. Constraint (9) indicates that the start time of the assembly task is later than the end time of the previous operation. ere are two meanings: one is to take C k � 0 for an assembly task that does 4 Mathematical Problems in Engineering not need to wait; the other is to take C k > 0 for an assembly task that needs to wait.…”

Section: Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

Jia

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Based on the practical application of an enterprise, we address the multistage job shop scheduling problem with several parallel machines in the first stage (production), a few parallel machines in the second stage (processing and assembly), and one machine in the following stages (including joint debugging, testing, inspection, and packaging). First, we establish the optimization objective model for the first two stages. Then, based on the design of the sequencing algorithm in the first two stages, a correction algorithm is designed between the first stage and the second stage to solve this problem systematically. Finally, we propose two benchmark approaches to verify the performance of our proposed algorithm. Verification of numerical experiments shows that the model and algorithm constructed in this paper effectively improve the production efficiency of the enterprise.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Modelsmentioning

confidence: 99%

Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

Jia

Zhang

2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Lu [14] drew inspiration from the ideas of [4], [6] and [21], then introduced another learning effect problem with position and processing time constraints, and prove that SPT rules can be used to solve some objective functions. Jiang [9] studied a single machine scheduling problem with learning effect and the total processing time constraint, and the analysis of multiple targets proved that it is NP-hard. Cheng [7] studied the rescheduling problems with learning effect under disruption constraints to minimize multiple classical targets.…”

Section: Introductionmentioning

confidence: 99%

A best possible algorithm for an online scheduling problem with position-based learning effect

Zhang

2022

JIMO

View full text Add to dashboard Cite

<p style='text-indent:20px;'>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 <inline-formula><tex-math id="M1">\begin{document}$ J_j $\end{document}</tex-math></inline-formula>, including the basic processing time <inline-formula><tex-math id="M2">\begin{document}$ p_j $\end{document}</tex-math></inline-formula> and the release time <inline-formula><tex-math id="M3">\begin{document}$ r_j $\end{document}</tex-math></inline-formula>, is only available when it arrives. The actual processing time <inline-formula><tex-math id="M4">\begin{document}$ p_j' $\end{document}</tex-math></inline-formula> of each job <inline-formula><tex-math id="M5">\begin{document}$ J_j $\end{document}</tex-math></inline-formula> is defined as a function related to its position <inline-formula><tex-math id="M6">\begin{document}$ r $\end{document}</tex-math></inline-formula>, i.e., <inline-formula><tex-math id="M7">\begin{document}$ p_j' = p_j(\alpha-r\beta) $\end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id="M8">\begin{document}$ \alpha $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M9">\begin{document}$ \beta $\end{document}</tex-math></inline-formula> are both nonnegative learning index. Our goal is to minimize the sum of completion time of all jobs. For this problem, we design a deterministic polynomial time online algorithm <i>Delayed Shortest Basic Processing Time</i> (DSBPT). In order to facilitate the understanding of the online algorithm, we present a relatively common and simple example to describe the execution process of the algorithm, and then by competitive analysis, we show that online algorithm DSBPT is a best possible online algorithm with a competitive ratio of 2.</p>

show abstract

Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect

et al. 2019

View full text Add to dashboard Cite

Single-machine scheduling with times-based and job-dependent learning effect

Cited by 7 publications

References 26 publications

Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

A best possible algorithm for an online scheduling problem with position-based learning effect

Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect

Contact Info

Product

Resources

About