A priori parallel machines scheduling

Bouyahia, Zied; Bellalouna, Monia; Jaillet, Patrick; Ghédira, Khaled

doi:10.1016/j.cie.2009.11.009

Cited by 15 publications

(24 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a previous work (see Bouyahia et al, 2010), we introduced a probabilistic generalization in which we consider the number of jobs as a random variable instead of defining it as a deterministic value. This random variable varies in ½1; n. More specifically, each job in the input has a probability of being present, independently from the others.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Load balancing a priori strategy for the probabilistic weighted flowtime problem

Bouyahia

Bellalouna

Ghédira³

2013

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

“…In a previous work (Bouyahia et al, 2010), we introduced and studied the probabilistic generalization of the classical total weighted completion time problem. We defined two a priori strategies devoted to the incorporated problem on parallel identical machines (U A and U B ).…”

Section: Introductionmentioning

confidence: 99%

Load balancing a priori strategy for the probabilistic weighted flowtime problem

Bouyahia

Bellalouna

Ghédira³

2013

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

“…Sotskov et al [20] presented a number of approaches based on interval processing times for the evaluation of robustness and stability in a single-machine environment. Bouyahia et al [21] proposed a probable comprehensive approach for the robustness design of pre-scheduling, which assumed that the number of jobs to be processed on parallel machines was a random variable. They studied the total weighted ow time as an objective function.…”

Section: Literature Reviewmentioning

confidence: 99%

A new proactive-reactive approach to hedge against uncertain processing times and unexpected machine failures in the two-machine flow shop scheduling problems

Rahmani¹

2017

Scientia Iranica

View full text Add to dashboard Cite

A new proactive-reactive approach to hedge against uncertain processing times and unexpected machine failures in the two-machine ow shop scheduling problems Abstract. In this paper, a proactive-reactive approach has been considered for achieving stable and robust schedules despite uncertain processing times and unexpected machine failures in a two-machine ow shop system. In the literature, Surrogate Measures (SMs) have been developed for achieving stable and robust solutions against the occurrence of stochastic disruptions. These measures proactively provide an approximation of the real conditions of the system in the event of a disruption. Because of the discrepancies of these measures with their real values, a di erent approach is developed in this paper in a two-step structure. First, an initial robust schedule is produced and then, based on a multi-component measure, an appropriate reaction is adopted against unexpected machine failures. Computational results indicate that this method produces better solutions compared to the other two classical scheduling approaches considering their e ectiveness and performance.

show abstract

“…A relatively small example of solving 12 jobs on 5 machines is provided and the results are discussed. Bouyahia et al (2010) contribute to the parallel machine scheduling problem by addressing long-term robust optimization. Their goal is to design robust a priori schedules which on the long term horizon are optimal or suboptimal with respect to total weighted flow time.…”

Section: Machine Schedulingmentioning

confidence: 99%

Scheduling under Uncertainty for Single-Hub Intermodal Freight System

Marković

Schonfeld

2011

Transportation Research Record

View full text Add to dashboard Cite

This thesis addresses the optimization of an intermodal system with freight transfers at a single hub. It investigates the transportation processes and constraints that arise in a system's recovery after a major disruption during which backlogs have accumulated along the routes. When dealing with the backlogs, the system operator must coordinate the transportation processes and control the inflow of freight to the terminal in order to avoid overloading its storage facilities, which might reduce the throughput of the system. The coordination of transportation processes during the system's recovery can further improve the overall system performance by reducing the dwell time, increasing vehicle utilization and reducing late delivery penalties. This work focuses on the scheduling problem and develops an approach that would help the system operator reduce the overall system cost while taking into account the constraints arising in actual intermodal and intra-modal systems. Assuming that the schedule on some routes is exogenously determined and inflexible, we seek to optimize the schedules of vehicles on remaining routes.Models are developed that minimize the total cost of operating an intermodal system with freight transfers at one hub by optimizing the departure times of vehicles on the routes with flexible schedules. This model can be solved numerically without the approximations of alternative methods such as simulation. Moreover, it can be successfully applied to situations when statistical or queuing analyses are not applicable due to the small number of events (vehicle arrivals). We specifically analyze an intermodal system consisting of multiple feeder truck routes and multiple main airline routes. The specific example of two transportation modes was used to make the development and application of the model easier to understand. However, the mathematical model developed in this thesis is applicable to any other combination of transportation modes using discrete vehicles.

show abstract

A priori parallel machines scheduling

Cited by 15 publications

References 39 publications

Load balancing a priori strategy for the probabilistic weighted flowtime problem

Load balancing a priori strategy for the probabilistic weighted flowtime problem

A new proactive-reactive approach to hedge against uncertain processing times and unexpected machine failures in the two-machine flow shop scheduling problems

Scheduling under Uncertainty for Single-Hub Intermodal Freight System

Contact Info

Product

Resources

About