• Title/Summary/Keyword: no-wait flow shop

Search Result 2, Processing Time 0.023 seconds

No-Wait Lot-Streaming Flow Shop Scheduling (비정체 로트 - 스트리밍 흐름공정 일정계획)

  • Yoon, Suk-Hun
    • IE interfaces
    • /
    • v.17 no.2
    • /
    • pp.242-248
    • /
    • 2004
  • Lot-streaming is the process of splitting a job (lot) into a number of smaller sublots to allow the overlapping of operations between successive machines in a multi-stage production system. A new genetic algorithm (NGA) is proposed for minimizing the mean weighted absolute deviation of job completion times from due dates when jobs are scheduled in a no-wait lot-streaming flow shop. In a no-wait flow shop, each sublot must be processed continuously from its start in the first machine to its completion in the last machine without any interruption on machines and without any waiting in between the machines. NGA replaces selection and mating operators of genetic algorithms (GAs), which often lead to premature convergence, by new operators (marriage and pregnancy operators) and adopts the idea of inter-chromosomal dominance. The performance of NGA is compared with that of GA and the results of computational experiments show that NGA works well for this type of problem.

A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem

  • Nagano, Marcelo Seido;Miyata, Hugo Hissashi
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.206-214
    • /
    • 2016
  • This paper deals with the no-wait flow shop scheduling problem in order to minimize the total time to complete the schedule or makespan. It is introduced a constructive heuristic which builds the production schedule from job partial sequences by using an appropriate mechanism of insertion. An extensive computational experiment has been performed to evaluate the performance of proposed heuristic. Experimental results have clearly shown that the presented heuristic provides better solutions than those from the best heuristics existing.