The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in real life production processes and subsumes open-shop, job-shop, and flow-shop scheduling as special cases. We here present an application of machine learning to adapt simple greedy strategies for the RCPSP. Iterative re...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness , total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to m...

In this paper we study the allocation of production services (e.g., maintenance) to machining centers in a job shop when there is a limited amount of resources for such services. Di€erent classes of jobs go through the shop. A job class is characterized by its route, its processing requirements, and its priority. The problem we address is how to optimally allocate production services (the resou...

We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability interval and present an approximation algorithm with a worst-case ratio of 4/3 for th...

In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...

The paper concerns the application of a non-classical performance measure, a late work criterion (Y, Yw), to scheduling problems. It estimates the quality of the obtained solution with regard to the duration of the late parts of tasks not taking into account the quantity of this delay. The paper provides the formal definition of the late work parameter, especially in the shop environment, toget...

La plupart des recherches arborescentes utilisées en recherche opérationnelle pour résoudre les problèmes d’atelier sont des procédures de séparation-évaluation en profondeur d’abord qui utilisent un backtrack chronologique qui présente quelques inconvénients comme le thrashing. Ces recherches arborescentes énumèrent non pas sur des variables, comme il est courant dans la communauté Programmati...

A variation of preemptive open shop scheduling corresponds to nding a feasible edge coloring in a bipartite multigraph with some requirements on the size of the di erent color classes. We show that for trees with xed maximum degree, one can nd in polynomial time an edge k-coloring where for i = 1; : : : ; k the number of edges of color i is exactly a given number hi, and each edge e gets its co...

In this paper presents the hybrid algorithm using firefly and a cuckoo search algorithm for flexible open shop scheduling problem. The flexible, open shop scheduling is known to be NP-hard. Cuckoo algorithm (CA) is one of the widely used techniques for constrained optimization. And it gave the best results compared to other algorithms. A disadvantage of cuckoo algorithm though is that they easi...