This study considers the production environment of the re-entrant flow-shop (RFS). In a RFS, all jobs have the same routing over the machines of the shop and the same sequence is traversed several times to complete the jobs. The aim of this study is to minimize make-span by using the genetic algorithm (GA) to move from local optimal solution to near optimal… (More)
This study considers the machine scheduling problem with limited waiting time constraints. We examine the machine environment of the open-shop, job-shop, flow-shop, and permutation flow-shop, and uses makespan as a measure performance. Eight mixed binary integer programming models are developed to optimally solve these problems.
Keywords: Scheduling Multiple orders per job Integer programming Heuristics Semiconductor manufacturing a b s t r a c t This paper deals with a single-machine scheduling problem with multiple orders per job (MOJ) considerations. Both lot processing machines and item processing machines are also examined. There are two primary decisions that must be made in… (More)
In recent years, companies have found that there are substantial benefit and competitive advantage from establishing a long-term sole-supplier relationship with supplier. In the integrated inventory model practices characterized by a sole-s u p p l i e r b a s e w h o s e f i r m i s l o c a t e d c l o s e t o t h e b u y e r ' s p l a n t a n d ma k e s f… (More)
This work addresses the single machine and parallel machine scheduling problems, where machine is flexibly maintained and mean flow time is used as a performance measure. Machine M k should be stopped for maintenance for a constant time w k in the schedule. The maintenance period [u k , v k ] is assumed to be set in advance, and the maintenance time w k is… (More)