Optimisation of Production Machine Scheduling Using a Two Level Mixed Optimisation Method

Commander Anil Rana; Ajit Verma; As Srividya

Displaying similar documents to “Optimisation of Production Machine Scheduling Using a Two Level Mixed Optimisation Method”

Evolutionary algorithms for job-shop scheduling

Khaled Mesghouni, Slim Hammadi, Pierre Borne (2004)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper explains how to use Evolutionary Algorithms (EA) to deal with a flexible job shop scheduling problem, especially minimizing the makespan. The Job-shop Scheduling Problem (JSP) is one of the most difficult problems, as it is classified as an NP-complete one (Carlier and Chretienne, 1988; Garey and Johnson, 1979). In many cases, the combination of goals and resources exponentially increases the search space, and thus the generation of consistently good scheduling is particularly...

Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning.

Zhu, Zhanguo, Sun, Linyan, Chu, Feng, Liu, Ming (2011)

Mathematical Problems in Engineering

Similarity:

Scheduling jobs in open shops with limited machine availability

Jacek Błażewicz, Piotr Formanowicz (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In...

Scheduling problems with a common due window assignment: A survey

Adam Janiak, Tomasz Kwiatkowski, Maciej Lichtenstein (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this survey we separately analyse the classical models with job-independent and job-dependent earliness/tardiness...

Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and 0-1 resource requirements

Ewa Figielska (2009)

Control and Cybernetics

Similarity:

Batch scheduling on two-machine flowshop with machine-dependent setup times.

Ben-Dati, Lika, Mosheiov, Gur, Oron, Daniel (2009)

Advances in Operations Research

Similarity:

Heuristic solving a bicriteria parallel-machine scheduling problem

Petr Fiala (1997)

Kybernetika

Similarity:

Lower bounds for the scheduling problem with uncertain demands

Djamel Berkoune, Khaled Mesghouni, Besoa Rabenasolo (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain...