We study multiprocessor scheduling games with setup times on identical machines. Given a set of scheduling policies (coordination mechanism) on the machines, each out of n players chooses a machine to assign his owned job to, so as to minimize his individual completion time. Each job has a processing length and is of a certain type. Same-type jobs incur a setup overhead to the machine they are ...

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

Today, because the market is scattered around world, manufacturing activities are not limited to a single location and have spread globally. As result, discussion of scheduling factory has changed from classic network as need in real world. In this regard, study considers multiple factories by taking into account job transportation time between factories. The main problem here that each would b...

This study investigates the single-machine scheduling problem with common due-win -dow assignment, past-sequence-dependent (p-s-d) setup times and a deteriorating maintenance activity. By past-sequence-dependent setup times, we mean that the setup time of a job is proportional to the sum of the processing times of the jobs already processed. The objective is to minimize a cost function based on...

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...

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...