The classical job shop scheduling (JSS) problem can be extended by allowing processing of an operation any machine from a given set. This type is known as flexible (FJSS) problem. It incorporates all the difficulties and complexities its predecessor However, it more complex required to determine assignment operations machine. Swarm intelligence techniques proved their effectiveness in solving w...

Purpose To investigate the efficiency of a discretization procedure utilizing a time-indexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising makespan and tardiness, respectively. Design/methodology/approach A time-indexed mixed integer programming model is used to find solutions by iteratively employing ti...

This paper provides an application oriented analysis of local search procedures for Operation Scheduling and Shop Floor Management of a major German manufacturer of cigarette machines. The heuristics applied are the Thresholdand Simulated Annealing-Algorithm considering Job Shop as well as embedded FMS production features. In this context a new neighbourhood search technique is developed, which...

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. It is quite difficult to achieve optimal or near-optimal solutions with single traditional optimization approach because the multi objective FJSP has the high computational complexity. An novel hybrid algorithm ...