In our recent research, we showed results of the comparative study on effects of using several kinds of scheduling evaluation criteria as the fitness function of a genetic algorithm for job-shop scheduling. From these results, we obtained that the idle time criterion sometimes can provide a good makespan-minimizing schedule for a job-shop scheduling problem. In this paper, according to the abov...

In this research, the flexible flow shop sequence dependent group scheduling problem (FFSDGS) with minimization of makespan as the criterion (FFm|fmls, Ssd|Cmax) is investigated. Since the problem is shown to be NP-hard, meta-heuristic algorithms are required to efficiently solve industry size problems. Thus, six different meta-heuristic algorithms based on tabu search (TS) are developed to eff...

This paper studies the bicriteria problem of scheduling n jobs on a parallel-batching machine to minimize maximum cost and makespan simultaneously. A is that can handle up b in batch. The batch start complete respectively at same time processing equal largest We consider unbounded case. For above problem, we present an O ( 3 )-time algorithm, which improved best known 4 complexity as special ca...

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

This paper considers the hybrid flow shop scheduling problem, where jobs are processed in m stages with same route of stage. Each stage has identical parallel machines for processing jobs. Some mathematical programming formulations and lower bound calculations have been proposed literature such...

On-chip resource sharing among sibling cores causes resource contention on Chip Multiprocessors (CMP), considerably degrading program performance and system fairness. Job co-scheduling attempts to alleviate the problem by assigning jobs to cores intelligently. Despite many heuristics-based empirical explorations, studies on optimal co-scheduling and its inherent complexity start only recently, ...

Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...

A scheduling problem is characterized by the properties of the jobs, the properties of the machines, the properties of the processing constraints and the optimality criterion. The properties of the jobs involve the processing time of the jobs, the release dates, deadlines and priorities. The properties of the machines are the number of machines, processing speeds of the machines and machine con...

In scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to ...