in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

Through times scheduling and planning became more and more important among production issues. A good scheduling application should be exible enough to allow a perfect representation of the problems and a interactive search of its solutions. At the same time it should be capable of solve them independently in a eecient way. In this paper we present an application devoted to the resolution of a r...

in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

not long ago, city gates and entryways had high spatial value and were among the landmarks for marking city boundaries. today with cities having been expanded and developed, such aspect of the entrance concept is lost and entryways are turned to passages for transportation. in fact, the rich spatial value of such entrances has decreased as they are solely spaces for passing through out or into ...

We give a short proof of a result of Tovey [Non-approximability of precedence-constrained sequencing to minimize setups, DiscreteAppl. Math. 134:351–360, 2004] on the inapproximability of a scheduling problem known as precedence-constrained class sequencing. In addition, we present an approximation algorithm with performance guarantee (c + 1)/2, where c is the number of colors. This improves up...

As we research to make the use of Computational Grids seamless, the allocation of resources in these dynamic environments is proving to be very unwieldy. In this paper, we introduce, describe and evaluate a technique we call request sequencing. Request sequencing groups together requests for Grid services to exploit some common characteristics of these requests and minimize network traÆc. The p...

Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP is NP-hard and mainly presents two difficulties. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on the machines. This paper proposes a parallel variable neighborhood search (PVNS)...

This work compares six sequencing operators that have been developed for use with genetic algorithms. An improved version of the edge recombination operator is presented, the concepts of adjacency, order, and position are reviewed in the context of these operators , and results are compared for a 30 city \Blind" Traveling Salesman Problem and a real world warehouse/shipping scheduling applicati...

1.1 History Sheet metal operations have been in existence since 8000 B.C. (Fries-Knoblach, 1999). Due to its long history, sheet metalworking is, unfortunately, often seen as archaic and uninteresting. That metal sheets can be transformed with the aid of robust machines into fancy consumer products with tight tolerances is inconceivable to many. Yet, sheet metal operations are used for producin...

Construction and facilities maintenance projects involve a large number of people and tasks with resource constraints and precedence constraints. This paper presents a new approach to model this problem as a resource-constrained multi-project scheduling problem (RCMPSP) with cost minimization. The scheduling problem is first decomposed into two sub-problems: schedule generation and sequencing. ...