We consider a robotic ow shop model in which a single robot is responsible for the transportation of parts between machines. For reasons of simplicity, when the shop is to produce a large number of identical parts, the robot usually performs repeatedly a xed sequence of activities. This sequence of activities is called a 1-unit cycle if each execution of the sequence results in the production o...

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposedinto two subproblems sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an...

The main contribution of this work is to apply Tabu search based algorithms for solution of scheduling of jobs in CMS environment. An attempt has been made in this work to vary the job sequencing so that optimal sequencing of jobs can be achieved. The idea behind this work is to perturb sequences in the search of better results. More the number of sequences higher will be the degree of the opti...

Optimized data transfer services are highly demanded nowadays, due to the large amounts of data which are frequently being produced and accessed. In this paper we consider several data transfer service optimization problems (optimal server location in path networks, optimal packet sequencing and minimum makespan packet scheduling), for which we provide novel algorithmic solutions.

the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...

In this paper we present novel polynomial-time algorithmic solutions for several timeand resource-constrained job scheduling and sequencing problems. We consider both the case of a single processor and that of multiple processors on which the jobs can be executed. The optimization objectives are functions of the cost and execution time parameters.

In February 2016 the Dagstuhl Seminar 16062 explored the needs of the semiconductor industry for better planning and scheduling approaches at the supply chain level and the requirements for information systems to support the approaches. The seminar participants also spent time identifying the core elements of a conceptual reference model for planning and control of semiconductor manufacturing s...

This work describes the conception, development and application of a methodology for the production scheduling in foundries. It has two important and linked moments, which are the furnace scheduling and the molding machines scheduling. The challenge consists in determining an adequate sequencing of production orders in the molding lines, combining light weight with average and heavy pieces, in ...

{During the last decade, the problem of production scheduling has been realized to be one of the most important problems in industrial plant operations especially when multipurpose/multiproduct batch processes are involved. This paper presents a novel mathematical formulation for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and...

We prove Fraenkel’s conjecture for the special case of symmetric words, and show that this proof implies the conjecture of Brauner and Crama [Facts and questions about the maximum deviation just-in-time scheduling problem, Discrete Appl. Math. 134 (2004) 25–50] concerning instances of the just-in-time sequencing problem with maximum deviation B∗< 1 2 . © 2007 Elsevier B.V. All rights reserved.