This research deals with the problem of scheduling N jobs on M unrelated parallel machines. Each job has a due date and requires a single operation. A setup that includes detaching one die and attaching another from the appropriate die type is incurred if the type of the job scheduled is different from the last job on that machine. Due to the mechanical structure of machines and the fitness of ...

http://dx.doi.org/10.1016/j.cie.2014.05.012 0360-8352/ 2014 Elsevier Ltd. All rights reserved. q This manuscript was processed by Area Editor Hans Kellerer. ⇑ Corresponding author. Address: Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan. Tel.: +886 2 2737 6337. E-mail address: [email protected] (C....

This paper solved the unrelated parallel machine scheduling with additional resources (UPMR) problem. The processing time and number of required for each job rely on that does processing. Each j needed units (rjm) during its a m. These are limited, this made UPMR difficult problem to solve. In study, maximum completion jobs makespan must be minimized. Here, we proposed genetic algorithm solve b...

This paper reviews results related to the parallel machine scheduling problem under availability constraints. The motivation of this paper comes from the fact that no survey focusing on this specific problem was published. The problems of single machine, identical, uniform, and unrelated parallel machines under different constraints and optimizing various objective functions were analyzed. For ...

In this research, Lagrangian relaxation algorithms are proposed for Hybrid Flow-Shop (HFS) scheduling problems. Conventional HFS consists of a series of production stages, each of which has several identical parallel machines and no buffer spaces are considered. Jobs are processed through all stages in the same direction. In the previous researches, they are assumed that the capacity of buffer ...