Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment

Shafaei, Rasoul; Brunn, Paul

doi:10.1080/002075499189682

Cited by 39 publications

(15 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Approaches to production scheduling and rescheduling in a dynamic environment can be classified into three main categories (Shafai and Bruno, 1999): completely reactive approaches, predictive-reactive approaches and robust scheduling. In completely reactive approaches, no firm schedule is generated in advance and decisions are made locally in real-time.…”

Section: Dynamic Schedulingmentioning

confidence: 99%

Untitled

Cowling

Ouelhadj

Petrović

2003

Journal of Intelligent Manufacturing

View full text Add to dashboard Cite

Steel production is a complex process and finding coherent and effective schedules for the wide variety of production steps, in a dynamic environment, is a challenging task. In this paper we propose a multi-agent architecture for integrated dynamic scheduling of the hot strip mill and the continuous caster. The scheduling systems of these processes have very different objectives and constraints, and operate in an environment where there is a substantial quantity of real-time information concerning production failures and customer requests. Each process is assigned to an agent which independently, seeks an optimal dynamic schedule at a local level taking into account local objectives, real-time information and information received from other agents. Each agent can react to real-time events in order to fix any problems that occur. We focus here, particularly, on the hot strip mill agent which uses a tabu search heuristic to create good predictive-reactive schedules quickly. The other agents simulate the production of the coil orders and the real-time events, which occur during the scheduling process. When real-time events occur on the hot strip mill, the hot strip mill agent might decide whether to repair the current schedule or reschedule from scratch. To address this problem, a range of schedule repair and complete rescheduling strategies are investigated and their performance is assessed with respect to measures of utility, stability and robustness, using an experimental simulation framework.

show abstract

Section: Dynamic Schedulingmentioning

confidence: 99%

Untitled

Cowling

Ouelhadj

Petrović

2003

Journal of Intelligent Manufacturing

View full text Add to dashboard Cite

show abstract

“…A simple approach would be to totally reschedule the system when the deviation occurs [5]. However, this approach is not encouraged in industry as the new schedule can differ considerably from the old one and this is not desirable since many other decisions such as assignment of personnel, delivery of raw material and the subsequent processing of the jobs in other facilities, may be severely disrupted.…”

Section: Introductionmentioning

confidence: 99%

Incremental temporal reasoning in job shop scheduling repair

Huang

Liu

Williams³

et al. 2010

2010 IEEE International Conference on Industrial Engineering and Engineering Management

View full text Add to dashboard Cite

A working predictive schedule can be useless because of the various external or internal disruptions in a job shop. Total rescheduling may cause problems such as shop floor nervousness. Thus, the job shop scheduling repair (recovery) approach aims at generating a solution satisfying the updated constraints and making deviations minimized. We propose an incremental temporal reasoning approach in this paper to solve job shop scheduling repair problems. Specifically, such a problem is formulated as a disjunctive temporal problem (DTP), framed as an optimal constraint satisfaction problem (OCSP) formally, and finally solved by performing an algorithm integrating incremental temporal consistency and efficient candidate generation. Through involving human interactive mechanism, domain experts can make higher quality decisions by balancing makespan and deviations.Keywords -Job shop scheduling repair (recovery), incremental temporal reasoning, disjunctive temporal problems, optimal constraint satisfaction problems, constraint-based scheduling 978-1-4244-8503-1/10/$26.00 ©2010 IEEE Proceedings of the 2010 IEEE IEEM

show abstract

“…Scheduling research has traditionally ignored this "process view" of the problem, and focuses on optimization of the performance measures under idealized assumptions of environmental stability. However, several authors have reported that these assumptions do not hold for most of the manufacturing environments due to random machine breakdowns, rush job arrival, tool breakage [9][10][11][12] etc.…”

Section: Introductionmentioning

confidence: 99%

Aspect of selective rerouting in multicriteria scheduling of flexible manufacturing

Singh¹

2010

Int. j. simul. model.

View full text Add to dashboard Cite

In this paper, a Multi-Criteria Scheduling Algorithm (MCSA) based on swapping of dispatching rules and Selective Rerouting (SR) approach based on lateral entry of critical jobs in the queue of alternate machine is used. Further, the effect of simultaneous application of MCSA and SR has been investigated. The system performance has been evaluated using mean flow time, maximum flow time, mean tardiness and maximum tardiness as the performance measures. Simulation studies using ProModel ® simulation software were carried out at different breakdown levels for a range of part complexity and part mix, in three types of flexible job shops with Job/Machine ratio less than, equal to and greater than unity involving a total of 799 simulation runs. Each run of simulation spans for a period of 2000 completed jobs. The results establish that simultaneous application of MCSA and SR improves the system performance between 12.17 % to 28.73 % and 30.51 % to 47.67 % over that when SR and MCSA respectively are applied individually. The improvement is more at low breakdown levels and high part complexity.

show abstract

Workshop scheduling using practical (inaccurate) data Part 2: An investigation of the robustness of scheduling rules in a dynamic and stochastic environment

Cited by 39 publications

References 0 publications

Untitled

Untitled

Incremental temporal reasoning in job shop scheduling repair

Aspect of selective rerouting in multicriteria scheduling of flexible manufacturing

Contact Info

Product

Resources

About