This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...

In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent machine-dependent setup times is studied. This can be found in various manufacturing contexts, particular workshops of wafer facilities. Three different criteria are defined analyzed: The number products completed before the end given time horizon, weighted sum completion resou...

.

This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

scheduling is an important subject of production and operations management area. in flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. the concept of transportation time is very important in scheduling. transportation can be done by robots. in situations that robots are used to transpor...