11 research outputs found
Flowshop scheduling problems with due date related objectives: A review of the literature
3rd International Conference on Industrial Engineering and Industrial Management
XIII Congreso de Ingeniería de Organización
Barcelona-Terrassa, September 2nd-4th 200
Programación de pedidos en una máquina de la vida real con tiempos de preparación dependientes de la secuencia
En este trabajo se evalúan algoritmos heurísticos de exploración de entornos
(AED, ANED, SA, TS, GA y GRASP) en la programación de pedidos en una
máquina de la vida real, con el objetivo de minimizar la suma de retrasos . El
caso estudiado se diferencia de los problemas convencionales en que los
tiempos de preparación de las operaciones están separados de los tiempos de
procesamiento y son dependientes de la secuencia. Los resultados
computacionales revelan que la Búsqueda Tabú funciona mejor que los otros
algoritmos aplicados
Procedimientos de exploración de entornos para la programación de operaciones en una máquina con tiempos de preparación
objetivo de minimizar el retraso total en un ambiente con preparaciones que
dependen de la secuencia. Se comparan los resultados obtenidos mediante la
aplicación de los procedimientos de exploración de entornos AED, ANED,
Recocido Simulado, Algoritmos Genéticos, Búsqueda Tabú y GRASP al
problema planteado. Los resultados sugieren que la Búsqueda Tabú es una
técnica viable de solución que puede proporcionar buenas soluciones cuando
se considera el objetivo retraso total con tiempos de preparación dependientes
de la secuencia
A survey of scheduling problems with setup times or costs
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
Recommended from our members
Essays in Scheduling: Applications in Health Care and Manufacturing
The problem of finding an optimal schedule is ubiquitous in human endeavor. Airlines strive to find the best schedule for their aircrafts and flight-crews, academic scheduling offices at universities schedule classes, and business organizations prioritize their jobs or customers and schedule them accordingly. Even in our day to day lives, whether consciously or not, we decide on our daily schedule and go about our sequence of tasks, prioritizing certain tasks, and procrastinating on others. Not surprisingly, scheduling of people, tasks, and manufacturing jobs constitute a significant proportion of the operations management literature. Despite all the research that has been published on scheduling, we encounter scheduling problems that call for novel approaches, and when treated with appropriate tools and techniques, provide interesting managerial insights. The dissertation consists of three such scheduling problems, two from the health care industry, and one from manufacturing. The first health care paper (Ganguly et al. 2013) employs mixed-integer linear programming to schedule physicians for a medical emergency department (ED). The second paper (Ganguly and Samorani 2013) uses an analytical approach for making real time updates to patient schedules in outpatient clinics that primarily operate on an appointment basis. The paper on manufacturing (Ganguly and Laguna 2013) develops heuristic techniques for a particular type of job-sequencing problem that involves two types of setups
The dynamic, resource-constrained shortest path problem on an acyclic graph with application in column generation and literature review on sequence-dependent scheduling
This dissertation discusses two independent topics: a resource-constrained shortest-path problem
(RCSP) and a literature review on scheduling problems involving sequence-dependent setup
(SDS) times (costs).
RCSP is often used as a subproblem in column generation because it can be used to
solve many practical problems. This dissertation studies RCSP with multiple resource
constraints on an acyclic graph, because many applications involve this configuration, especially
in column genetation formulations. In particular, this research focuses on a dynamic RCSP
since, as a subproblem in column generation, objective function coefficients are updated using
new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial
solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic
graph with the goal of effectively reoptimizing RCSP in the context of column generation. This
method uses a one-time âÂÂpreliminaryâ phase to transform RCSP into an unconstrained shortest
path problem (SPP) and then solves the resulting SPP after new values of dual variables are used
to update objective function coefficients (i.e., reduced costs) at each iteration. Network
reduction techniques are considered to remove some nodes and/or arcs permanently in the preliminary phase. Specified techniques are explored to reoptimize when only several
coefficients change and for dealing with forbidden and prescribed arcs in the context of a column
generation/branch-and-bound approach. As a benchmark method, a label-setting algorithm is
also proposed. Computational tests are designed to show the effectiveness of the proposed
algorithms and procedures.
This dissertation also gives a literature review related to the class of scheduling
problems that involve SDS times (costs), an important consideration in many practical
applications. It focuses on papers published within the last decade, addressing a variety of
machine configurations - single machine, parallel machine, flow shop, and job shop - reviewing
both optimizing and heuristic solution methods in each category. Since lot-sizing is so
intimately related to scheduling, this dissertation reviews work that integrates these issues in
relationship to each configuration. This dissertation provides a perspective of this line of
research, gives conclusions, and discusses fertile research opportunities posed by this class of
scheduling problems.
since, as a subproblem in column generation, objective function coefficients are updated using
new values of dual variables at each iteration. This dissertation proposes a pseudo-polynomial
solution method for solving the dynamic RCSP by exploiting the special structure of an acyclic
graph with the goal of effectively reoptimizing RCSP in the context of column generation. This
method uses a one-tim
Mejora de tiempos de entrega en un flow shop híbrido flexible usando técnicas inteligentes. Aplicación en la industria de tejidos técnicos
Se busca aportar herramientas útiles para la programación de producción en la industria de tejidos técnicos. Se parte de las condiciones actuales de la programación de producción en este tipo de industria y de los antecedentes en la literatura científica sobre modelos aplicables a estos entornos. Se propone un modelo de solución por técnicas inteligentes a la problemática de la secuenciación y asignación de tareas en los entornos flow shop híbrido flexible considerando situaciones como: paralelismo entre máquinas no relacionadas, tiempos de montaje dependientes de la secuencia, entrada dinámica de trabajos, restricción de elegibilidad, maleabilidad y lotes de transferencia variables entre etapas. De allí se construye la propuesta de solución que involucra simultáneamente todas las condiciones de entorno real mencionadas y aplica un algoritmo genético modificado de acuerdo a las características del problema. Se concluye que el modelado considerando condiciones realistas es posible, que los algoritmos genéticos son una opción práctica para entornos reales y que las empresas pueden obtener mejoras en su capacidad de respuesta con este tipo de solucionesAbstract : It seeks to provide useful tools for production scheduling in the technical textiles industry. It begins in the current conditions of production scheduling in this type of industry and the background in scientific literature, applicable to these environments models. The mathematical model to solve the problem of sequencing and assigning jobs in Flexible hybrid flow shop environments is developed considering: unrelated parallel machines, sequence dependent setup time, dynamic entry of jobs, availability constrain, malleability and variable transfer batches between stages. The solution proposal is build including all actual environment features considered together and applying a modified genetic algorithm modeled according to the problem. It is concluded that the model of scheduling problems considering realistic conditions is possible, that genetic algorithms are a practical option for real environments, and that companies can achieve improvements in their responsiveness with this kind of solutionsDoctorad
An investigation of changeover sensitive heuristics in an industrial job shop environment
EThOS - Electronic Theses Online ServiceGBUnited Kingdo
Sessenta anos de Shop Scheduling : uma revisão sistemática da literatura
Orientador : Prof. Dr. Cassius Tadeu ScarpinDissertação (mestrado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Engenharia de Produção. Defesa: Curitiba, 09/02/2017Inclui referências : f. 449-492Resumo: Desde o seminal artigo de Johnson em 1954, a Programação da Produção em Shop Scheduling tem se tornado uma área relevante dentro da Pesquisa Operacional e, atualmente, duzentos trabalhos tangentes à temática são publicados anualmente. Dentre os artigos aqui citados tem-se aqueles que se dedicam à apresentação e síntese do estado da arte desse assunto, intitulados artigos de revisão. Quando tais artigos são elaborados a partir de um conjunto objetivo de critérios, relativos à categorização dos artigos selecionados, tem-se a Revisão Sistemática da Literatura (RSL). O presente trabalho realiza uma RSL em Shop Scheduling, a partir da análise de cada ambiente fabril que o compõe. Fez-se o escrutínio de 560 artigos, à luz de um conjunto de métricas, que constitui a estrutura basilar da proposta de nova taxonomia do Shop Scheduling, complementar à notação de Graham, objetivo fulcral do presente trabalho. Além disso, utilizou-se uma representação em redes dos resultados obtidos em algumas das métricas empregadas, como a característica dos itens, algo outrora inaudito em estudos de revisão desse assunto. Ademais, outro ponto relevante desse estudo repousa na identificação de campos pouco explorados, de modo a colaborar com a pesquisa futura neste tomo. Palavras-chave: Shop Scheduling. Revisão Sistemática da Literatura. Taxonomia. Representação em Redes.Abstract: Since Johnson's seminal article in 1954, Shop Scheduling in Production Scheduling has become a relevant area within Operational Research, and currently hundreds of tangential works on the subject are published annually. Among the articles cited here are those dedicated to the presentation and synthesis of the state of the art of this subject, which are entitled review articles. When these articles are elaborated from an objective set of criteria, regarding the categorization of the selected articles, we have the Systematic Review of Literature (SLR). The present work performs a SLR in Shop Scheduling, based on the analysis of each manufacturing environment that composes it. There were 560 articles scrutinized based on a set of metrics, which is the basic structure of the proposed new Taxonomy of Shop Scheduling, complementary to Graham's notation, the main objective of this work. In addition to that a network representation of the results was obtained in some of the metrics used, such as the job characteristics, something previously unheard of in review studies of this subject. Moreover, another relevant point of this study lies in the identification of less explored fields in order to collaborate with future research in this matter. Keywords: Shop Scheduling. Systematic Literature Review. Taxonomy. Network Representation