Single Machine Scheduling
Mostrando 1-10 de 10 artigos, teses e dissertações.
-
1. ANALYSIS OF MIXED INTEGER PROGRAMMING FORMULATIONS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH SEQUENCE DEPENDENT SETUP TIMES AND RELEASE DATES
ABSTRACT The scheduling of jobs over a single machine with sequence dependent setups is a classical problem setting that appears in many practical applications in production planning and logistics. In this work, we analyze six mixed-integer formulation paradigms for this classical context considering release dates and two objective functions: the total weigh
Pesqui. Oper.. Publicado em: 09/05/2019
-
2. SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES, WITH EARLINESS AND TARDINESS PENALTIES: A CASE STUDY IN A MACHINING PROCESS / O PROBLEMA DO SEQUENCIAMENTO EM UMA ÚNICA MÁQUINA, COM TEMPOS DE PREPARAÇÃO DEPENDENTES DA SEQUÊNCIA E PENALIDADES POR ANTECIPAÇÃO E ATRASO: ESTUDO DE CASO DE UM PROCESSO DE FABRICAÇÃO POR USINAGEM
A dissertação estuda o problema do sequenciamento de uma única máquina com tempos de preparação dependentes da sequência da produção e penalidades por antecipação e atraso. Ilustra um método com uma aplicação a um exemplo de processo de fabricação por usinagem. Dessa forma, pretende-se reunir as metodologias de resolução e os trabalhos exis
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 25/01/2012
-
3. The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound
Computational & Applied Mathematics. Publicado em: 2010-06
-
4. Proposta de solução de problemas de scheduling considerando possibilidade de terceirização usando a técnica de otimização por colônia de formigas
Althought the scheduling-related literature has a high level of diversity, just a small group have been considering the possibility of outsource a set of tasks. During a literature review, only two papers related to this theme were found, both dealing on scheduling projects with outsource possibilities on single-machine environments. Along with this scenario
Publicado em: 2010
-
5. UM ALGORITMO HEURÍSTICO HÍBRIDO PARA MINIMIZAR OS CUSTOS COM A ANTECIPAÇÃO E O ATRASO DA PRODUÇÃO EM AMBIENTES COM JANELAS DE ENTREGA E TEMPOS DE PREPARAÇÃO DEPENDENTES DA SEQUÊNCIA
This work deals with the single machine scheduling problem with earliness and tar- diness penalties. Sequence dependent setup times and distinct due windows are con- sidered. To solve this problem, a three-phase heuristic approach was developed. The rst phase is based on GRASP and Variable Neighborhood Descent to generate an initial solution; the second phas
Publicado em: 2009
-
6. Relaxação lagrangeana com fixação de variáveis aplicada ao problema de sequenciamento em uma máquina
This paper deals with the Single-machine Scheduling Problem. This kind of problem arises in several practical situations, such as the problems of planning operations on machines in a manufacturing industry. The Single-machine Scheduling Problem consists in sorting n jobs to be processed on a single machine. The jobs are independent and the machine can only e
Publicado em: 2008
-
7. Branch-and-bound method application in a single machine earliness/tardiness scheduling problem with a common due date. / Aplicação do método branch-and-bound na programação de tarefas em uma única máquina com data de entrega comum sob penalidades de adiantamento e atraso.
The objective of this work is to study the single-machine scheduling problem with a common due date. In this case, jobs, after be processed only once in the machine, must be delivered in a common due date and they are penalized of earliness or tardiness according to their completion time. This problem is found in cases of batch production with prespecified c
Publicado em: 2006
-
8. Distribuição de carga e variação de capacidade na programação da produção: resultados na inserção de espera e na utilização de capacidade adicional. / Workload and capacity variation in production scheduling: results in idle time and additional capacity management.
This thesis analyses two cases of one-machine problem regarding to production scheduling with fixed sequence. In both problems, modeling with mathematical programming, and (pseudo)polynomial-time algorithms are suggested. The first problem deals with idle time insertion in the problem where the objective function (represented by a sum of costs) considers tha
Publicado em: 2000
-
9. Algoritmos memeticos aplicados aos problemas de sequenciamento em maquinas
The Single Machine Scheduling Problem (SMS) is one of the most representative in the scheduling area. In this work we initially explore the SMS problem with time constraints (due-dates and setup times). The goal is to minimize the total tardiness, which is characterized by the sum of the delays in the production of all products. The method chosen is based on
Publicado em: 1999
-
10. Beam Search and idle time insertion in the single-machine scheduling problem in a JIT environment. / Beam Search e inserção de ociosidade no problema de programação de uma máquina em ambiente do tipo JIT.
This work presents some procedures which can be used in production scheduling problems in JIT environments. These procedures may be used in cases of classical production scheduling where the use of the kanban system is infeasible. The case studied is based on a single machine, with multiple due dates, and distinct earliness and tardiness penalties for each j
Publicado em: 1997