A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times

Azadeh, A.; Habibnejad-Ledari, H.; Zadeh, Saeed Abdolhossein; Farahani, Mehdi Hosseinabadi

doi:10.1080/0951192x.2016.1145808

Cited by 13 publications

(6 citation statements)

References 56 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the nonlinear state of constraint (5), this model is a non-linear model. By changing the constraint (5) to a linear one based on Azadeh et al (2016b), the model will be linearized.…”

Section: Linearizingmentioning

confidence: 99%

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

Rabbani¹,

Bosjin²,

Yazdanparast³

et al. 2018

10.5267/j.dsl

View full text Add to dashboard Cite

This paper presents a new multi-objective model for a vehicle routing problem under a stochastic uncertainty. It considers traffic point as an inflection point to deal with the arrival time of vehicles. It aims to minimize the total transportation cost, traffic pollution, customer dissatisfaction and maximizes the reliability of vehicles. Moreover, resiliency factors are included in the model to increase the flexibility of the system and decrease the possible losses that may impose on the system. Due to the NP-hardness of the presented model, a metaheuristic algorithm, namely Simulated Annealing (SA) is developed. Furthermore, a number of sensitivity analyses are provided to validate the effectiveness of the proposed model. Lastly, the foregoing meta-heuristic is compared with GAMS, in which the computational results demonstrate an acceptable performance of the proposed SA. .

show abstract

“…Due to the nonlinear state of constraint (5), this model is a non-linear model. By changing the constraint (5) to a linear one based on Azadeh et al (2016b), the model will be linearized.…”

Section: Linearizingmentioning

confidence: 99%

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

Rabbani¹,

Bosjin²,

Yazdanparast³

et al. 2018

10.5267/j.dsl

View full text Add to dashboard Cite

show abstract

“…To show that σ dominates σ ′ , it suffices to show that C j (σ) ≤ C j (σ ′ ). Taking the difference between (19) and (21), it is obtained that…”

Section: The Nondecreasing Function F(x Y) On Xmentioning

confidence: 99%

“…e three objective functions are considered, including the weighted sum of total completion time, total load, and total compression cost. Extensive surveys of different scheduling models can be found in Azadeh et al [21], Pei et al [22], and Tai [23]. More application of scheduling models, especially, many real-world problems have been explained by using mathematical models such as higher-order spectral analysis of stray flux signals for faults' detection in induction motors, vortex theory for two-dimensional Boussinesq equations, normal complex contact metric manifolds admitting a semisymmetric metric connection, urea injection and uniformity of ammonia distribution in the SCR system of diesel engine, and new complex and hyperbolic forms for Ablowitz-Kaup-Newell-Segur wave equation with fourth order can be found in the following papers: Iglesias Mart et al [24], Sharifi and Reasi [25], Jiao and Zheng [26], and Eskita et al [27].…”

Section: Introductionmentioning

confidence: 99%

Single-Machine Scheduling Problems with the General Sum-of-Processing-Time and Position-Dependent Effect Function

Shen¹,

Yu-ke

Liu

2021

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

This paper considers the combination of the general sum-of-processing-time effect and position-dependent effect on a single machine. The actual processing time of a job is defined by functions of the sum of the normal processing times of the jobs processed and its position and control parameter in the sequence. We consider two monotonic effect functions: the nondecreasing function and the nonincreasing function. Our focus is the following objective functions, including the makespan, the sum of the completion time, the sum of the weighted completion time, and the maximum lateness. For the nonincreasing effect function, polynomial algorithm is presented for the makespan problem and the sum of completion time problem, respectively. The latter two objective functions can also be solved in polynomial time if the weight or due date and the normal processing time satisfy some agreeable relations. For the nondecreasing effect function, assume that the given parameter is zero. We also show that the makespan problem can remain polynomially solvable. For the sum of the total completion time problem and a 1 is the deteriorating rate of the jobs, there exists an optimal solution for a 1 ≥ M ; a V-shaped property with respect to the normal processing times is obtained for 0 < a 1 ≤ 1 . Finally, we show that the sum of the weighted completion problem and the maximum lateness problem have polynomial-time solutions for a 1 > M under some agreeable conditions, respectively.

show abstract

“…Several studies investigated the learning and forgetting effect, but recently the scheduling problem faced more attention. The major part of works focused on the scheduling problem on a single machine (Rustogi & Strusevich, 2014;Wang, 2007;Lee et al, 2011;Li et al 2018a;Li et al, 2018b;Ahmadizar et al, 2013;Azadeh et al, 2017). The problem addressed is to determine the optimal sequence of the jobs to reduce the processing times.…”

Section: Introductionmentioning

confidence: 99%

Flexible job-shop scheduling with learning and forgetting effect by Multi-Agent System

Renna¹

2019

10.5267/j.ijiec

View full text Add to dashboard Cite

The processing time of the machine is assumed fixed in several studies. In many real industrial applications, the processing time is affected by learning and forgetting effects. This research proposes a scheduling approach to support a manufacturing system under learning/forgetting effect. The approach is supported by a Multi-Agent System to perform the scheduling activities in a quasi-real-time and in general manufacturing systems. A simulation environment is developed to test the proposed approach and the results are compared with a benchmark model for evaluating several performance measures of the manufacturing system. The simulation results highlight how the proposed approach improves all the performance measures under different conditions of inter-arrival time, learning and forgetting rates. A complete Analysis of the Variance highlights the main effects on the performance measures to support the decision maker of the manufacturing system.

show abstract

A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times

Cited by 13 publications

References 56 publications

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

Single-Machine Scheduling Problems with the General Sum-of-Processing-Time and Position-Dependent Effect Function

Flexible job-shop scheduling with learning and forgetting effect by Multi-Agent System

Contact Info

Product

Resources

About