Parallel machine scheduling problem with preemptive jobs and transportation delay

Shams, Hesam; Salmasi, Nasser

doi:10.1016/j.cor.2014.04.008

Cited by 8 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate the performance of this new linear formulation, we have executed it on 270 instances generated according to the intervals used in Shams and Salmasi (2014). For each configuration (n, m), 30 instances are generated by taking the processing times in [1, 10], [1,40] and [1 III.…”

Section: Experiments and Resultsmentioning

confidence: 99%

“…In our investigation concerning the solution of the general problem on m machines, we realized that except for some heuristics present in Boudhar and Haned (2009), all problem solving approaches found in the literature are exact. We quote essentially algorithms presented by Shams and Salmasi (2014). These exact algorithms are applicable only on the small and the medium sized-instances (not exceeding 100 jobs).…”

Section: Experiments and Resultsmentioning

confidence: 99%

“…For identical transportation delays, this new formulation improves the one presented by Shams and Salmasi (2014) in the sense that it contains less binary variables. The number of variables is reduced from O(n 6 ) to O(n 4 ) with the introduction of new constraints that reduce the domain of solutions.…”

Section: Details and Explanationsmentioning

confidence: 94%

“…The study is concluded by proposing a dynamic program and a fully polynomial time approximation scheme to solve approximately the P2|pmtn(delay ii 0 )| C max problem. Shams and Salmasi (2014) studied the problem with fixed transportation delays. They have discussed and criticized the proposed mathematical model presented in Boudhar and Haned (2009) and proposed a new model.…”

Section: Preemptive Scheduling On Identical Machinesmentioning

confidence: 99%

See 3 more Smart Citations

Preemptive scheduling with transportation delays between machines

Badaoui

Boudhar

Dahane

2020

JM2

View full text Add to dashboard Cite

Purpose This paper studies the preemptive scheduling problem of independent jobs on identical machines. The purpose of this paper is to minimize the makespan under the imposed constraints, namely, the ones that relate the transportation delays which are required to transport a preempted job from one machine to another. This study considers the case when the transportation delays are variable. Design/methodology/approach The contribution is twofold. First, this study proposes a new linear programming formulation in real and binary decision variables. Then, this study proposes and implements a solution strategy, which consists of two stages. The goal of the first stage is to obtain the best machines order using a local search strategy. For the second stage, the objective is to determine the best possible sequence of jobs. To solve the preemptive scheduling problem with transportation delays, this study proposes a heuristic and two metaheuristics (simulated annealing and variable neighborhood search), each with two modes of evaluation. Findings Computational experiments are presented and discussed on randomly generated instances. Practical implications The study has implications in various industrial environments when the preemption of jobs is allowed. Originality/value This study proposes a new linear programming formulation for the problem with variable transportation delays as well as a corresponding heuristic and metaheuristics.

show abstract

Section: Experiments and Resultsmentioning

confidence: 99%

Section: Experiments and Resultsmentioning

confidence: 99%

Section: Details and Explanationsmentioning

confidence: 94%

Section: Preemptive Scheduling On Identical Machinesmentioning

confidence: 99%

See 2 more Smart Citations

Preemptive scheduling with transportation delays between machines

Badaoui

Boudhar

Dahane

2020

JM2

View full text Add to dashboard Cite

show abstract

“…Balin proposed a new genetic algorithm revised from an optimum criterion and new crossover operator, and then verify the efficiency of proposed algorithm by simulating result [7]. Moreover, some other algorithms also respect to solve the parallel machine scheduling problem [8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

The Dynamic Scheduling of Spray Booth Machine in 4S Auto Maintenance Shop

Li¹,

Li²,

Qin³

2016

Proceedings of the International Symposium on Mechanical Engineering and Material Science

View full text Add to dashboard Cite

Abstract. Theory of constraint point out that the bottleneck is a major factor which restricts the system going toward the target. Therefore, the bottleneck is the key of scheduling process in entire system. In fact, due to the factors of long processing time, high cost and few amounts, spray booth machine become the bottleneck in the whole 4S auto maintenance shop. Through reasonable scheduling of spray booth machine, we can improve system's efficiency and customer's satisfaction. First, combining with the real situation, we apply a triplet method to describe the spray booth scheduling problem in 4S maintenance shop. On this basis, a multi-objectives model with multi-constraint is constructed for the scheduling problem. Combining with the real situation, the scheduling model also can be regard as machine in parallel with different speed and machine eligibility restriction and job's characteristic. And then, we design a two-phased heuristic algorithm based on the dispatching rules and particle swarm optimization algorithm to solve it. Finally, we show the experimental results and compares with usual methods to demonstrate the superior performance of the proposed method.

show abstract

Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs

Yan

Cai

et al. 2021

Computers & Operations Research

View full text Add to dashboard Cite

Parallel machine scheduling problem with preemptive jobs and transportation delay

Cited by 8 publications

References 8 publications

Preemptive scheduling with transportation delays between machines

Preemptive scheduling with transportation delays between machines

The Dynamic Scheduling of Spray Booth Machine in 4S Auto Maintenance Shop

Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs

Contact Info

Product

Resources

About