We address a complex scheduling problem arising in the wood panel industry with the objective of minimizing a quadratic function of job tardiness. The proposed solution strategy, which is based on an effective genetic algorithm, has been coded and implemented within a major Tunisian company, leader in the wood panel manufacturing. Preliminary experimental results indicate significant decrease o...

In this paper, a general multi-level decomposition based framework has been proposed for integration of planning and scheduling in a multi-site, multi-product plant, with applications to paper manufacturing. The problem involves complex issues relating to large-scale production in a hybrid flowshop configuration, decisions relating to minimizing trim losses, while maintaining on-time delivery o...

Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processin...

We propose an incremental search method for making planning decisions in real time. As an example, we present the problem of scheduling jobs in a factory as a real-time decision problem, and model the real-time constraints as strict limits on the amount of computation that can be performed before a scheduling decision must be made. Our approach is to use incremental heuristic search techniques ...

in this paper a new problem of three stage disassembly-assembly scheduling is introduced and reviewed. this problem, which was arisen from the aviation industry characteristics, is a generalization of the two stage assembly scheduling problem. products (helicopters) in the aviation industry return to assembler for annual overhaul repair services. in the first stage helicopters are disassembled ...

This paper considers a flowshop scheduling problem with a waiting time constraint imposed to restrict the processing of the two operations of each job. If the second operation of a job cannot start within a specified waiting time after the completion of its first operation, then an extra processing time will be incurred for its second operation as a penalty. We first show that is even a greatly...

We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The forming of each batch on the second machine incurs a constant setup time. The objective is to minimize the makespan. This problem was previously shown to be NP-hard in the ordinary sense. In this paper, we first presen...

This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...