This paper introduces a new two-stage assembly scheduling problem. There are m machines at the first stage each of which produces a component of a job. When all m components are available, a single assembly machine at the second stage completes the job. The objective is to schedule jobs on the machines so that the makespan is minimized. It is shown that the search for an optimal solution may be...

In this paper, mathematical models for permutation flow shop scheduling and job shop scheduling problems are proposed. The first problem is based on a mixed integer programming model. As the problem is NP-complete, this model can only be used for smaller instances where an optimal solution can be computed. For large instances, another model is proposed which is suitable for solving the problem ...

This paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. First, the problem is formulated as a mixed integer linear programming model. Then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. Two experiments are carried out to evaluate th...

Design of assembly line is done in order to more coordinate a collection of some consecutive work stations for the aim of obtaining more productivity from the work stations and workers. The stations are arranged in a way to have a continuous and constant material flow. In this paper a multi-objective formulation for assembly line balancing is introduced. As a solution approach a two-step approa...

Scheduling is an important process widely used in manufacturing, production, management, computer science, and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. Finding good schedules for given sets of jobs can thus help factory supervisors effectively control job flows and provide solutions for job sequencing. In simple f...

This paper considers a flexible flow shop scheduling problem, where at least one production stage is made up of unrelated parallel machines. Moreover, sequenceand machinedependent setup times are given. The objective is to find a schedule that minimizes a positively weighted convex sum of makespan and the number of tardy jobs in a static flexible flow shop environment. For this problem, a 0-1 m...