04231 Abstracts Collection -- Scheduling in Computer and Manufacturing Systems

During 31.05.-04.06.04, the Dagstuhl Seminar 04231 "Scheduling in Computer and Manufacturing Systems" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the JIT approach in job shops. A dynamic programming procedure is developed to solve smaller instances of the problem, and a Multi-Agent Systems approach is developed and implemented to solve the problem for larger instances since this problem is known to be NP-Hard in a strong sense. A combinational auction-based approach using a Mixed-Integer Linear Programming (MILP) model to construct and evaluate the bids is proposed. The results showed that the proposed combinational auction-based algorithm is able to find optimal solutions for problems that are balanced in processing times across machines. A price discrimination process is successfully implemented to deal with unbalanced problems. The exact and heuristic procedures developed in this research are the first steps to create a structured approach to handle this problem and as a result, a set of benchmark problems will be available to the scheduling research community

A common framework and taxonomy for multicriteria scheduling problems with Interfering and competing Jobs: Multi-agent scheduling problems

Most classical scheduling research assumes that the objectives sought are common to all jobs to be scheduled. However, many real-life applications can be modeled by considering different sets of jobs, each one with its own objective(s), and an increasing number of papers addressing these problems has appeared over the last few years. Since so far the area lacks a uni ed view, the studied problems have received different names (such as interfering jobs, multi-agent scheduling, mixed-criteria, etc), some authors do not seem to be aware of important contributions in related problems, and solution procedures are often developed without taking into account existing ones. Therefore, the topic is in need of a common framework that allows for a systematic recollection of existing contributions, as well as a clear de nition of the main research avenues. In this paper we review multicriteria scheduling problems involving two or more sets of jobs and propose an uni ed framework providing a common de nition, name and notation for these problems. Moreover, we systematically review and classify the existing contributions in terms of the complexity of the problems and the proposed solution procedures, discuss the main advances, and point out future research lines in the topic

Two-agent scheduling in open shops subject to machine availability and eligibility constraints

Purpose: The aims of this article are to develop a new mathematical formulation and a new heuristic for the problem of preemptive two-agent scheduling in open shops subject to machine maintenance and eligibility constraints. Design/methodology: Using the ideas of minimum cost flow network and constraint programming, a heuristic and a network based linear programming are proposed to solve the problem. Findings: Computational experiments show that the heuristic generates a good quality schedule with a deviation of 0.25% on average from the optimum and the network based linear programming model can solve problems up to 110 jobs combined with 10 machines without considering the constraint that each operation can be processed on at most one machine at a time. In order to satisfy this constraint, a time consuming Constraint Programming is proposed. For n = 80 and m = 10, the average execution time for the combined models (linear programming model combined with Constraint programming) exceeds two hours. Therefore, the heuristic algorithm we developed is very efficient and is in need. Practical implications: Its practical implication occurs in TFT-LCD and E-paper manufacturing wherein units go through a series of diagnostic tests that do not have to be performed in any specified order. Originality/value: The main contribution of the article is to split the time horizon into many time intervals and use the dispatching rule for each time interval in the heuristic algorithm, and also to combine the minimum cost flow network with the Constraint Programming to solve the problem optimally.Peer Reviewe

Auction based scheduling for distributed systems

Cataloged from PDF version of article.Businesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector tends to consolidate their manufacturing facilities on a single supplier serving to a distributed customer network. This decentralized structure causes imperfect information sharing between customers and the supplier. We model this problem as a single machine distributed scheduling problem with job agents representing the customers and the machine agent representing the supplier. For benchmarking purpose, we analyzed the problem under three different scenarios: decentralized utility case (realistic case), centralized utility case, centralized cost case (classical single machine early/tardy problem). We developed Auction Based Algorithm by exploiting the opportunity to use game theoretic approach to solve the problem in the decentralized utility case. We used optimization techniques (Lagrangean Relaxation and Branch-and-Bound) for the centralized cases. Results of our extensive computational experiments indicate that Auction Based Algorithm converges to the upper bound found for the total utility measure.Zarifoğlu, EmrahM.S

Total completion time scheduling problem with temperature considerations

Bu çalışmanın odağı tek makineli çizelgeleme problemlerinde iş ortam sıcaklığının analiz edilmesidir. Klasik çizelgeleme problemlerinde çoğunlukla işlem zamanları iş ortamının sıcaklık etkisi olmadan düşünülür. Fakat birçok gerçek çizelgeleme ortamında, iş ortamı sıcaklığı işin doğasından dolayı işlem zamanını etkileyebilir. Bu makalede toplam tamamlanma zamanı (ve tamamlanma zamanlarının karesi toplamı) problemleri için iş ortamı sıcaklığına bağlı işlerin işlem zamanları sunulmuştur. Her iki amaç için de polinom zamanlı çözümler elde edilmiştir.The focus of this work is to analyze working environment temperature in single-machine scheduling problems. In classical scheduling problems, the processing times are considered usually without the effect of working environment temperature. However, in many real scheduling environments, working environment temperature may affect processing time due to the nature of work. In this paper, we present job processing times based on the working environment temperature for total completion time (square) problem. We derive solutions with polynomial-time for both objectives

Algorithms for Scheduling Problems

This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling problem, scheduling problems in complex manufacturing systems and supply chains, and workflow scheduling problems are given. The chapters address such subjects as insertion heuristics for energy-efficient scheduling, the re-scheduling of train traffic in real time, control algorithms for short-term scheduling in manufacturing systems, bi-objective optimization of tortilla production, scheduling problems with uncertain (interval) processing times, workflow scheduling for digital signal processor (DSP) clusters, and many more

Improving urban deliveries via collaboration

Distribution of goods is essential for the economic development of cities but at the same time it entails several problems to the urban systems and different stakeholders. Carriers spend a significant portion of their cost in the last-mile distribution due to traffic congestion and lack of available loading/unloading facilities. In turn, citizens undergo environmental effects like pollution, noise or space competition. Collaborative transportation is currently one of the major trends in transportation research due to its potential benefits with little need for big infrastructure or costly investments. This thesis deals with three different situations that appear repeatedly in the urban context, which can be improved by means of collaboration among private companies and/or public authorities. The first part of the thesis studies a little-disruptive collaboration approach, which is based on sharing loading/unloading urban facilities via an in-advance booking system, managed by local public authorities. In this context, the Parking Slot Assignment Problem is the mathematical problem that finds assignments of carriers to parking places that satisfy their time windows requests. We propose a feasibility model first, and then four other models with various objective functions that penalize in different ways the deviation from the requested time windows. We propose and compare two different formulations: one with time as a continuous variable and a second one with time discretization. Finally, we evaluate and compare the different proposals with extensive computational experiments in a set of test instances. An intermediate level of collaboration among carriers is studied in the second part of this thesis. Urban areas have high customers density and usually there are shared customers (customers with demand from different carriers in the same time horizon). We propose an innovative problem: the Shared Customer Collaboration Vehicle Routing Problem, where several carriers are willing to collaborate transferring part of the demand of their shared customers, if the overall transportation cost is reduced. A vehicle-based and a load-based formulation are studied, and experimented over a specifically generated instance set. The highest level of collaboration in urban deliveries resorts to Urban Consolidation Centers, which are normally led by public authorities but need the collaboration of carriers for a successful implementation. Urban Consolidation Centers are urban terminals where the load from different carriers is consolidated and then, a unique neutral carrier performs last-mile deliveries. In the third part of the thesis we propose continuous models that analyze the improvement in efficiency of urban distribution with the use of Urban Consolidation Centers under different assumptions. Continuous approximation models are known to produce robust solutions, which are useful to provide guidelines for general cases through sensitive analysis. In the three parts of the thesis, innovative models and approaches are proposed and validated on experiments that use data from real scenarios.La distribució urbana de mercaderies és una activitat essencial pel desenvolupament de les ciutats. Al mateix temps, però, comporta diversos problemes als nuclis urbans i als diferents actors involucrats. Els costos de la distribució urbana resulten una part molt significativa dels costos dels transportistes, especialment a causa de la congestió i la manca de zones de càrrega i descàrrega. Per altre banda, els ciutadans pateixen els efectes de la pol¢lució, el soroll o la competició per l’espai públic. El transport col¢laboratiu és actualment una de les principals tendències de recerca en transport, doncs ofereix beneficis atractius amb poca inversió. Aquesta tesi tracta tres situacions que trobem repetidament en el context urbà, situacions on diverses formes de col¢laboració poden representar una millora, i que consideren tant col¢laboració entre empreses privades com la col·laboració conjunta d’empreses privades amb les administracions. La primera part de la tesi estudia un nivell de col·laboració baix, basat en compartir les zones de càrrega i descàrrega gràcies a un sistema de reserves gestionat per l’administració. En aquest context, sorgeix el Parking Slot Assignment Problem (Problema d’assignació de places de parking), com el problemamatemàtic que assigna transportistes a places de parking satisfent els seus requeriments a través de finestres temporals. En primer lloc proposem un model de factibilitat, i després proposem quatremodelsamb funcions objectius desiguals que penalitzen la desviació de les finestres temporals de formes diferents. Es proposen i comparen dues formulacions: una amb el temps com una variable contínua, i la segona amb discretització temporal. Finalment, s’avaluen i es comparen les diferents propostes a través d’uns extensos experiments computacionals en un conjunt de test basat en dades reals. Un nivell intermedi de col¢laboració entre transportistes s’analitza en la segona part d’aquesta tesi. Les àrees urbanes presenten una alta densitat de clients i és comú trobar clients compartits (és a dir, clients que reben mercaderies a través de diferents transportistes en el mateix interval temporal). Proposem un problema innovador: el Shared Customer Collaboration Vehicle Routing Problem (Problema de rutes de vehicles amb col·laboració de clients compartits), on diferents transportistes estan disposats a col¢laborar transferint part de la demanda dels seus clients compartits, si el cost total de transport es redueix. S’estudien dues formulacions: una basada en els vehicles i una altra basada en la càrrega, i s’experimenta en un conjunt d’instàncies generades. El màxim nivell de col¢laboració en distribució urbana de mercaderies és l’ús de centres de consolidació urbana. Aquests centres estan normalment liderats per l’administració pública però necessiten l’activa col·laboració dels transportistes per aconseguir una implantació amb èxit. Els centres de consolidació urbana són terminals urbanes on es consolida la càrrega dels diferents transportistes i després, un únic transportista neutral realitza la distribució d’última milla. En aquesta tercera part de la tesi proposem models continus que analitzen la millora de l’eficiència en la distribució urbana a través de l’ús de centres de consolidació urbana amb diferents hipòtesis. Els models continus produeixen solucions robustes, que són útils per proporcionar guies en casos genèrics a través de l’anàlisi de sensibilitat. En les tres parts de la tesi es proposen nous enfocs i models que es validen a través d’experiments utilitzant dades obtingudes d’escenaris realsLa distribución urbana de mercancías es una actividad esencial para el desarrollo de las ciudades, aunque al mismo tiempo conlleva diversos problemas en los núcleos urbanos y los distintos actores involucrados. Los costes de la distribución urbana resultan una parte muy significativa de los costes de los transportistas, especialmente a causa de la congestión y la falta de zonas de carga y descarga. Por otro lado, los ciudadanos sufren los efectos de la contaminación, el ruido y la competición por el espacio público. El transporte colaborativo es actualmente una de las principales tendencias en la investigación en transporte, pues ofrece beneficios atractivos con poca inversión. Esta tesis trata tres situaciones que se reproducen repetidamente en el contexto urbano, donde distintas formas de colaboración (tanto entre compañías privadas como con administraciones) pueden representar una mejora. La primera parte de la tesis estudia un nivel de colaboración bajo, basado en compartir las zonas de carga y descarga a través de un sistema de reservas gestionado por la administración. En este contexto surge el Parking Slot Assignment Problem (Problema de asignación de plazas de parking), como el problema matemático que asigna transportistas a plazas de parking satisfaciendo sus requerimientos a través de ventanas temporales. En primer lugar proponemos un modelo de factibilidad, y después cuatro modelos con funciones objetivo que penalizan la desviación de las ventanas temporales de formas distintas. Se proponen y comparan dos formulaciones: una con el tiempo como una variable continua, y la segunda con discretización temporal. Finalmente, se evalúa y compara las distintas propuestas a través de unos extensos experimentos computacionales en un conjunto de test basado en datos reales. Un nivel intermedio de colaboración entre transportistas se analiza en la segunda parte de esta tesis. Las áreas urbanas presentan una alta densidad de clientes, y es común encontrar clientes compartidos (es decir, clientes que reciben mercancías a través de distintos transportistas en el mismo intervalo temporal). Proponemos un problema innovador: el Shared Customer Collaboration Vehicle Routing Problem (Problema de rutas de vehículos con colaboración de clientes compartidos), donde los distintos transportistas están dispuestos a colaborar transfiriendo parte de la demanda de sus clientes compartidos, si el coste total del transporte se reduce. Estudiamos dos formulaciones: una basada en los vehículos y otra basada en la carga, y se experimenta en un conjunto de instancias generadas. El máximo nivel de colaboración en distribución urbana de mercancías es el uso de centros de consolidación urbana. Estos centros, normalmente liderados por la administración pública, necesitan la activa colaboración de los transportistas para conseguir una exitosa implantación. Se trata de terminales urbanas donde se consolida la carga de distintos transportistas y, después, un único transportista neutral realiza la distribución de última milla. En esta tercera parte de la tesis proponemos modelos continuos que analizan la mejora de la eficiencia en la distribución urbana a través del uso de centros de consolidación urbana con distintas hipótesis. Los modelos continuos producen soluciones robustas, que son útiles para proporcionar guías en casos genéricos a través del análisis de sensibilidad. En las tres partes de la tesis se proponen nuevos enfoques y modelos que se validan con experimentos utilizando datos obtenidos en escenarios reale