Classification of Scheduling Problems

Scheduling is a vital element of manufacturing processes and requires optimal solutions under undetermined conditions. Highly dynamic and, complex scheduling problems can be classified as np-hard problems. Finding the optimal solution for multi-variable scheduling problems with polynomial computation times is extremely hard. Scheduling problems of this nature can be solved up to some degree using traditional methodologies. However, intelligent optimization tools, like BBAs, are inspired by the food foraging behavior of honey bees and capable of locating good solutions efficiently. The experiments on some benchmark problems show that BBA outperforms other methods which are used to solve scheduling problems in terms of the speed of optimization and accuracy of the results. This chapter first highlights the use of BBA and its variants for scheduling and provides a classification of scheduling problems with BBA applications. Following this, a step by step example is provided for multi-mode project scheduling problem in order to show how a BBA algorithm can be implemented.

Download Full-text

Definition, Analysis and Classification of Scheduling Problems

Scheduling Computer and Manufacturing Processes ◽

10.1007/978-3-662-03217-6_3 ◽

1996 ◽

pp. 57-72 ◽

Cited By ~ 1

Author(s):

Jacek Błażewicz ◽

Klaus H. Ecker ◽

Erwin Pesch ◽

Günter Schmidt ◽

Jan Węglarz

Keyword(s):

Scheduling Problems

Download Full-text

Classification of Scheduling Problems

Scheduling Algorithms ◽

10.1007/978-3-662-04550-3_1 ◽

2001 ◽

pp. 1-10 ◽

Cited By ~ 1

Author(s):

Peter Brucker

Keyword(s):

Scheduling Problems

Download Full-text

Analysis of Feeder Bus Network Design and Scheduling Problems

The Scientific World JOURNAL ◽

10.1155/2014/408473 ◽

2014 ◽

Vol 2014 ◽

pp. 1-10 ◽

Cited By ~ 8

Author(s):

Mohammad Hadi Almasi ◽

Sina Mirzapour Mounes ◽

Suhana Koting ◽

Mohamed Rehan Karim

Keyword(s):

Network Design ◽

Descriptive Analysis ◽

Future Research ◽

Scheduling Problems ◽

Bus Scheduling ◽

Feeder Bus ◽

Solution Methods ◽

Problem Description ◽

Bus Network

A growing concern for public transit is its inability to shift passenger’s mode from private to public transport. In order to overcome this problem, a more developed feeder bus network and matched schedules will play important roles. The present paper aims to review some of the studies performed on Feeder Bus Network Design and Scheduling Problem (FNDSP) based on three distinctive parts of the FNDSP setup, namely, problem description, problem characteristics, and solution approaches. The problems consist of different subproblems including data preparation, feeder bus network design, route generation, and feeder bus scheduling. Subsequently, descriptive analysis and classification of previous works are presented to highlight the main characteristics and solution methods. Finally, some of the issues and trends for future research are identified. This paper is targeted at dealing with the FNDSP to exhibit strategic and tactical goals and also contributes to the unification of the field which might be a useful complement to the few existing reviews.

Download Full-text