We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing or decreasing functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum...

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. in some of the applications of unrelated parallel mac...

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

Due to the depletion of the fossil fuels and major concerns about the security of energy in the future to produce fuels, the importance of utilizing the renewable energies is distinguished. Nowadays there has been a growing interest for biofuels. Thus, this paper reveals a general optimization model which enables the selection of preprocessing centers for the biomass, biofuel plants, and wareho...

We consider scheduling a single server in a multi-class queue subject to setup times and setup costs. We examine the issue of whether or not reductions in the mean and variance of the setup time distributions can lead to degraded system performance. Provided that setups are reduced according to a stochastically smaller ordering, we show that if an optimal policy is used both for the original sy...

This paper presents an MILP model for the permutation flowshop wherein the setup times are both separable from the job processing times and independent of a job’s position in the processing sequence. Two experiments were conducted to estimate the computer times necessary to solve problems with up to 9 machines and 15 jobs, and to then compare these solution time requirements to those required ...