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 we consider a class of parallel machine scheduling problems and their associated set-partitioning formulations. We show that the tightness of the linear programming relaxation of these formulations is directly related to the performance of a class of heuristics called parameter list scheduling heuristics. This makes it possible to characterize the worst possible gap between optima...

Abstract— In order to determine necessary time to reach a desired quota, the manager of a flexible batch manufacturing system must know the best method of scheduling the factory. To determine a sub-optimal schedule, we first create a model of the factory. This model is used to simulate the factory. Using this simulation and an integer programming formulation, we determine a scheduling algorithm...

One of the most significant optimization issues facing a manufacturing company is flexible flow shop scheduling problem (FFSS). However, FFSS with uncertainty and energy-related elements has received little investigation. Additionally, in order to reduce overall waiting times earliness/tardiness issues, topic shared due dates researched. Using transmission line loadings bus voltage magnitude va...

In this paper a dynamic task scheduling unit for many-core systems The CoreManager instruction set extensions are developed with the tool flow. An instruction set architecture extension for supporting fine-grain thread scheduling and execution is proposed. Task level parallelization is supported by various programming models core and the Distributed Thread Scheduling Unit (DTSU), one per node. ...

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

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for t...

Scheduling is an important factor for the efficient execution of computational workflows on Grid environments. A large number of static scheduling heuristics has been presented in the literature. These algorithms allocate tasks before job execution starts and assume a precise knowledge of timing information, which may be difficult to obtain in general. To overcome this limitation of static stra...

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery.  jobs have to be scheduled on a single machine and delivered to  customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...