Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies ...

Each of N jobs is to be processed on a single machine. Only one job can be processed at any given time. Each switch from one job to another requires sequence dependent setup time. The objective is to find a processing order which minimizes the makespan. Let call this problem the OMSC problem. OMSC problem is defined as a grouping problem. A heuristics called SGP Heuristics and based on spectral...

Assembly lines appear with various differentiations in order to better include the disabled labor market and increase production efficiency. In this way, optimal workforce assignment problem that emerges heterogeneously is called assembly line worker balancing (ALWABP). This paper addresses ALWABP where simple version enriched by considering sequence-dependent setup times between tasks. A mixed...

In circuit board manufacturing, the production sequencing problem with sequence dependent setups is complicated by the fact that the amount of setup required depends on not only the setup directly before the current setup, but can depend on all of the preceding setups. We present a case study that examines the use of a heuristic for estimating the expected number of setups from the sequence dep...