This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...

Makine çizelgeleme problemlerinde tüm makineler daima kullanılabilir durumda değildirler. Planlı bakım, öğle yemeği ve dinlenme molaları gibi nedenlerle periyodik olarak kesintilere uğrayabilmektedirler. Ancak literatürde genellikle bu durum göz ardı edilmektedir. Bu çalışmada kullanılamayan zaman dilimlerinin sıra bağımlı hazırlık sürelerinin olduğu ilişkisiz paralel makine problemi ele alınmı...

This paper considers the hybrid flow shop scheduling problem with two types of sequence-dependent setup times, one depending on order jobs and other both machines where are allocated. Three constructive heuristic algorithms based NEH algorithm developed object minimizing total energy consumption cost. The first algorithm, called EPRA, obtains using cost processing time. second ESRA, third ESPRA...