this paper presents a new mathematical model for a bi-objective job shop scheduling problem with sequence-dependent setup times that minimizes the weighted mean completion time and the weighted mean tardiness time. for solving this multi-objective model, we develop a fuzzy multi-objective linear programming (fmolp) model. in this problem, a proposed fmolp method is applied with respect to the o...

 Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (WIP) inventory. In this paper, the “CONstant Work-In-Process” (CONWIP) concept is applied to job shop scheduling to effectively control WIP inventory. A new mathematical formulation of CONWIP-based job shop schedulin...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness , total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to m...

Flexibility in job shop scheduling is a main problem that has been considered by many of researchers in recent years.So Scheduling for the flexible job shop is very important in the field of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem in medium and actual size problems with traditional optimization approache...

This paper presents a meta-heuristic algorithm for solving a job shop scheduling problem involving both sequence dependent setup-times and the possibility of selecting alternative routes among the available machines. The proposed strategy is a variant of the Iterative Flattening Search (IFS) schema. This work provides three separate results: (1) a constraint-based solving procedure that extends...

In this paper we study the allocation of production services (e.g., maintenance) to machining centers in a job shop when there is a limited amount of resources for such services. Di€erent classes of jobs go through the shop. A job class is characterized by its route, its processing requirements, and its priority. The problem we address is how to optimally allocate production services (the resou...

Multi Objective Job Shop Scheduling Problem (MOJSP) is a problem for finding optimal operation sequences of some jobs according to more than one goal to achieve. The problem gets harder as its complexity increases. The development of optimization method has led many new methods to solve this problem. This paper offers Cross Entropy-Genetic Algorithm (CEGA) method to solve job shop scheduling pr...

A mutation-selection approach for the general job shop scheduling problem is presented. The underlying algorithm uses threshold accepting as an iterative search technique generating alternative operation sequences for the machines of the job shop. Search is combined with a simple heuristic algorithm transforming operation sequences into a schedule. Effectiveness of the approach is demonstrated ...

This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach ...