In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

This paper focuses on an industrial lot-sizing and scheduling problem that arises in the food industry includes lost sales, overtimes sequence-dependent setups parallel machines. We propose a preliminary version of three-phase iterative approach to optimize separately affectation, sequencing production items. Our first numerical results suggest with some additional improvements, this could be u...

During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. In this paper, we present a unified representation and modeling approach for process scheduling problems. Four different time representations are presented, compared, and applied to single-stage and multi-stage batch s...

This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabili...

The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and product demands. It requires the determination of optimal cyclic schedule, thus greatly reducing the size of the overall scheduling problems with large time horizon. In this paper a new cyclic scheduling approach is p...

air defense is a crucial area for all naval combat systems. in this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. we define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. the optimal scheduling of the weapon results in an in...

In this paper we address a multi-objective scheduling problem for unrelated parallel machines. In unrelated parallel systems, the processing cost/time of a given job on different machines may vary. The objective of scheduling is to simultaneously determine the job-machine assignment and job sequencing on each machine. In such a way the total cost of the schedule is minimized. The cost function ...

This paper presents an overview of assignment and sequencing models that are used in the scheduling of process operations with mathematical programming techniques. Although scheduling models are problem specific, there are common features which translate into similar types of constraints. Two major categories of scheduling models are identified: single-unit assignment models in which the assign...

Production scheduling deals with scheduling production jobs on a machine (single or multiple) in order to optimise a specific objective such as total weighted completion times or total weighted tardiness. The assumption that machines are always available for processing jobs is generally used in the production scheduling literature. In reality, machines often are unavailable due to preventive ma...