In this paper a new approach is presented to solve multi-objective production scheduling and rescheduling problems. Furthermore the relationship between production goals and heuristic solving methods in an extended flexible flow shop environment is also investigated. We define production goals by specifying objective functions and apply special production constraints for the extended flow shop ...

Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained challenging. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experimen...

A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probab...

The purpose of this study is to develop an effective scheduling methodology for a realistic flow shop sequencing problem. The flow shop consists of two machines where only the first machine has separable, external, and sequence dependent setup times. The length of setup times required for a job depends not on the immediately preceding job but on the job which is two steps prior to it. The probl...

The problem of scheduling in a Flow Shop with Multiple Processors (FSMP) is considered with the objective of minimizing the makespan for static problems. Herein, the usefulness of simulated annealing (SA) is investigated. Two stages are used in generating the makespans. A good initial-heuristic-seed sequence, obtained in the first stage, is improved-upon in the second stage by the SA technique....

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for t...

Job shop scheduling problems occurs in automobile industry, aerospace industry, printing industry, and chemical industry. Job shop scheduling problems are real world and complex. The present work assesses the effect of change in setup times levels on make span, maximum flow time and maximum tardiness measures. The model of the job shop is developed in PROMODEL simulation software. Three levels ...

Abstract: We develop a constant-inventory tactical planning model for a generic manufacturing system, such as a job shop. The model is based on a discrete-time, continuous flow model developed by the first author. In the model, we assume that we can regulate the release of work to the shop to maintain the constant-inventory constraint. We characterize the conditions for which the shop productio...

Choi, B.-C., Yoon, S.-H., Chung, S.-J., 2007. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176, 964–974 consider the proportionate flow shop with a slow bottleneck machine and propose the SLDR heuristic for it. Choi et al. (2007) derive a data-dependent worst-case ratio bound for the SLDR heuristic ...

Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained a challenge. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experimen...