One of the greatest difficulties in working with combinatorial optimization is that the methods require specific procedures for each problem. Even general purpose methods, like Evolutionary Algorithms, require operators developed specifically for the problems. Suppose, for example, that someone has developed a code to solve Single Machine Scheduling problems. If such person decides to change an...

This paper focuses on the flowshop scheduling problem with sequence dependent setup times (FSSP-SDST), which has been an investigated object for decades as one of the most popular scheduling problems in manufacturing systems. A novel hybrid local search algorithm called HLS is presented to solve the flowshop scheduling problem with sequence dependent setup times with the criterion of minimizing...

Usually, scheduling of maintenance operations and production sequencing are dealt with separately in the literature and, therefore, also in the industry. Given that maintenance affects available production time and elapsed production time affects the probability of machine failure, this interdependency seems to be overlooked in the literature. This paper presents a comparative study on joint pr...

The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...

In this paper, an integrated multilevel, control-theoretic framework has been proposed for effectively handling integration of planning, scheduling, and rescheduling. A general resourceconstrained, multistage, multiproduct plant operating as a hybrid flowshop facility has been considered. The proposed approach is based on the inherent hierarchical decomposition of the overall decision-making pr...

Hybrid Flowshop Scheduling (HFS) is one of the most comprehensively studied in scheduling problems. HFS has m-machines in each stage so that it is more complicated that regular flowshop scheduling. There are several production systems using HFS, such as steel manufacture, textile, and paper industry [8] [15]. Makespan and total tardiness are two important goals in scheduling to make the schedul...

This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second-stage of a flowshop for processing the component parts in batch...