Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system

doi:10.1016/J.IJPE.2009.11.032

Home
/
Papers
/
Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system

Journal Article•DOI•

Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system

Adil Baykasoğlu¹, Lale Özbakır²•Institutions (2)

University of Gaziantep¹, Erciyes University²

01 Apr 2010-International Journal of Production Economics (Elsevier)-Vol. 124, Iss: 2, pp 369-381

TL;DR: It is found out that the effect of dispatching rule selection on job shop performance weakens as the job shop flexibility increases, and should be taken into account while designing scheduling systems for job shops that are flexible.

read less

About: This article is published in International Journal of Production Economics.The article was published on 2010-04-01. It has received 40 citations till now. The article focuses on the topics: Flow shop scheduling & Job shop.

...read moreread less

Citations

PDF

Open Access

More filters

Journal Article•DOI•

An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem

[...]

Xinyu Li¹, Liang Gao¹•Institutions (1)

Huazhong University of Science and Technology¹

01 Apr 2016-International Journal of Production Economics

TL;DR: An effective hybrid algorithm which hybridizes the genetic algorithm (GA) and tabu search (TS) has been proposed for the FJSP with the objective to minimize the makespan and the experimental results demonstrate that the proposed HA has achieved significant improvement for solving FJ SP regardless of the solution accuracy and the computational time.

...read moreread less

360 citations

Cites background or methods from "Analyzing the effect of dispatching..."

...Brucker and Schile (1990) first presented FJSP and proposed a polynomial graphical algorithm (PGA) to solve a two-job FJSP....
[...]
...Brucker and Schile (1990) first presented FJSP and proposed a polynomial graphical algorithm (PGA) to solve a two-job FJSP. Torabi et al. (2005) proposed a mixed integer nonlinear program for the common cycle multi-product lot-scheduling problem in deterministic flexible job shops, which needed to determine the machine allocation, sequencing, lot-sizing and scheduling decisions simultaneously. Gomes et al. (2005) presented a new integer linear programming model for FJSP and used the commercial mixed-integer linear programming (MILP) software to solve this problem....
[...]
...Brucker and Schile (1990) first presented FJSP and proposed a polynomial graphical algorithm (PGA) to solve a two-job FJSP. Torabi et al. (2005) proposed a mixed integer nonlinear program for the common cycle multi-product lot-scheduling problem in deterministic flexible job shops, which needed to determine the machine allocation, sequencing, lot-sizing and scheduling decisions simultaneously. Gomes et al. (2005) presented a new integer linear programming model for FJSP and used the commercial mixed-integer linear programming (MILP) software to solve this problem. Demir and Isleyen (2013) evaluated several mathematical models of FJSP....
[...]
...Tay and Ho (2008) used DRs discovered through genetic programming to solve the multi-objective FJSP. Baykasoglu and Ozbakir (2010) analyzed the effects of DRs on the scheduling performance of job shops with different flexibility levels....
[...]
...The current approaches for solving FJSP mainly include exact algorithm (Demir and Isleyen, 2013), dispatching rules (Baykasoglu and Ozbakir, 2010), evolutionary algorithm (EA) (Pezzella et al., 2008; Demir and Isleyen, 2013; Palacios et al., 2015a; Yuan and Xu, 2015), swarm intelligence (SI) based…...
[...]

Journal Article•DOI•

A research survey: review of flexible job shop scheduling techniques

[...]

Imran Ali Chaudhry¹, Abid Ali Khan•Institutions (1)

University of the Sciences¹

01 May 2016-International Transactions in Operational Research

TL;DR: The paper aims at presenting the development of flexible JSS and a consolidated survey of various techniques that have been employed since 1990 for problem resolution.

...read moreread less

293 citations

Cites methods from "Analyzing the effect of dispatching..."

...…(2009) Research Heuristic implementing Aker’s graphical algorithm (Akers and Friedman, 1955), FJSSP with machine nonavailability constraints Makespan – Baykasoğlu and Özbakır (2010) Research Effect of dispatching rules on the scheduling performance through grammars Minimum of mean…...
[...]

Journal Article•DOI•

Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system

[...]

V. Vinod, R. Sridharan¹•Institutions (1)

National Institute of Technology Calicut¹

01 Jan 2011-International Journal of Production Economics

TL;DR: The salient aspects of a simulation study conducted to investigate the interaction between due-date assignment methods and scheduling rules in a typical dynamic job shop production system are presented and it is found that dynamic due- date assignment methods provide better performance.

...read moreread less

137 citations

Journal Article•DOI•

A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling

[...]

Tsung-Che Chiang¹, Hsiao Jou Lin¹•Institutions (1)

National Taiwan Normal University¹

01 Jan 2013-International Journal of Production Economics

TL;DR: A multiobjective evolutionary algorithm is proposed, which utilizes effective genetic operators and maintains population diversity carefully and needs only two parameters.

...read moreread less

119 citations

Cites methods from "Analyzing the effect of dispatching..."

...Baykasoglu and Özbakir (2010) applied a TS, in which a solution encoded machine assignment for routing and encoded dispatching rules for operation sequencing in the Giffler and Thompson (GT) algorithm (Giffler and Thomspon, 1960)....
[...]

Journal Article•DOI•

An effective hybrid algorithm for integrated process planning and scheduling

[...]

Xinyu Li¹, Xinyu Shao¹, Liang Gao¹, Weirong Qian¹•Institutions (1)

Huazhong University of Science and Technology¹

01 Aug 2010-International Journal of Production Economics

TL;DR: The results show that the research on integrated process planning and scheduling (IPPS) is necessary and the proposed approach is a promising and very effective method on the research of IPPS.

...read moreread less

88 citations

Cites background from "Analyzing the effect of dispatching..."

...Baykasoglu and Ozbakir (2009) analyzed the effect of dispatching rules on the scheduling performance of flexible job shop with different flexibility levels....
[...]
...Anosike and Zhang (2009) proposed an agentbased approach for integrating manufacturing operations....
[...]

1
2
3
4
…
5
6
7
8

Collapse

References

PDF

Open Access

More filters

Journal Article•DOI•

Tabu Search—Part II

[...]

Fred Glover

01 Aug 1989-Informs Journal on Computing

TL;DR: The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.

...read moreread less

Abstract: This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part II, in this issue, examines refinements and more advanced aspects of tabu search. Following a brief review of notation, Part II introduces new dynamic strategies for managing tabu lists, allowing fuller exploitation of underlying evaluation functions. In turn, the elements of staged search and structured move sets are characterized, which bear on the issue of finiteness. Three ways of applying tabu search to the solution of integer programmin...

...read moreread less

5,883 citations

Journal Article•DOI•

A state-of-the-art survey of dispatching rules for manufacturing job shop operations.

[...]

John H. Blackstone, Don T. Phillips, Gary L. Hogg

01 Jan 1982-International Journal of Production Research

TL;DR: A review of the state of the art in the study of dispatching rules can be found in this paper, where a dispatching rule is used to select the next job to be processed from a set of jobs awaiting service.

...read moreread less

Abstract: This paper reviews recent studies of dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. The paper has two objectives. The first is to discuss the state of the art in the study of dispatching rules. The discussion includes analytical approaches, simulation techniques and evaluation criteria. The second objective of the paper is to compare several of the dispatching rules listed in the Appendix using the results of recently published studies. It is impossible to identify any single rule as the best in all circumstances. However, several rules have been identified as exhibiting good performance in general.

...read moreread less

967 citations

Journal Article•DOI•

Routing and scheduling in a flexible job shop by tabu search

[...]

Paolo Brandimarte¹•Institutions (1)

Polytechnic University of Turin¹

01 May 1993-Annals of Operations Research

TL;DR: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.

...read moreread less

Abstract: A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature for complex scheduling problems, and the tabu search metaheuristic, being able to cope with different memory levels, provides a natural background for the development of a hierarchical algorithm. For the case considered, a two level approach has been devised, based on the decomposition in a routing and a job shop scheduling subproblem, which is obtained by assigning each operation of each job to one among the equivalent machines. Both problems are tackled by tabu search. Coordination issues between the two hierarchical levels are considered. Unlike other hierarchical schemes, which are based on a one-way information flow, the one proposed here is based on a two-way information flow. This characteristic, together with the flexibility of local search strategies like tabu search, allows to adapt the same basic algorithm to different objective functions. Preliminary computational experience is reported.

...read moreread less

874 citations

Journal Article•DOI•

A genetic algorithm for the Flexible Job-shop Scheduling Problem

[...]

Ferdinando Pezzella¹, G. Morganti¹, G. Ciaschetti•Institutions (1)

Marche Polytechnic University¹

01 Oct 2008-Computers & Operations Research

TL;DR: A genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP) integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals to prove that genetic algorithms are effective for solving FJSP.

...read moreread less

770 citations

Journal Article•DOI•

Algorithms for Solving Production-Scheduling Problems

[...]

B. Giffler¹, G. L. Thompson¹•Institutions (1)

IBM¹

01 Aug 1960-Operations Research

TL;DR: It is shown that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of allactive schedules.

...read moreread less

Abstract: Algorithms are developed for solving problems to minimize the length of production schedules. The algorithms generate anyone, or all, schedules of a particular subset of all possible schedules, called the active schedules. This subset contains, in turn, a subset of the optimal schedules. It is further shown that every optimal schedule is equivalent to an active optimal schedule. Computational experience with the algorithms shows that it is practical, in problems of small size, to generate the complete set of all active schedules and to pick the optimal schedules directly from this set and, when this is not practical, to random sample from the bet of all active schedules and, thus, to produce schedules that are optimal with a probability as close to unity as is desired. The basic algorithm can also generate the particular schedules produced by well-known machine loading rules.

...read moreread less

757 citations