Design of user interfaces for job shop environment

User-computer interface development has gone through rapid development in recent years. These developments, however, have not yet been fully implemented in management information system (MIS) design for job shop manufacturing situations. Most of the commercially available MISs are operationally inflexible and do not support management in report generation and decision making, particularly in job shops. This paper describes a framework in developing system user interfaces for job shop manufacturing situations to highlight how a generic information system can be made more useful to managerial decision making. Object-oriented programming technology has been used to provide flexible access to information stored by a generic MIS. Twenty interfacing programs have been developed. For illustration, only three of those interface programs relating to generation of strategic level management reports are discussed here.

Pareto archived simulated annealing for single machine job shop scheduling with multiple objectives

In this paper, the single machine job shop scheduling problem is studied with the objectives of minimizing the tardiness and the material cost of jobs. The simultaneous consideration of these objectives is the multi-criteria optimization problem under study. A metaheuristic procedure based on simulated annealing is proposed to find the approximate Pareto optimal (non-dominated) solutions. The two objectives are combined in one composite utility function based on the decision maker’s interest in having a schedule with weighted combination. In view of the unknown nature of the weights for the defined objectives, a priori approach is applied to search for the non-dominated set of solutions based on the Pareto dominance. The obtained solutions set is presented to the decision maker to choose the best solution according to his preferences. The performance of the algorithm is evaluated in terms of the number of non-dominated schedules generated and the proximity of the obtained non-dominated front to the true Pareto front. Results show that the produced solutions do not differ significantly from the optimal solutions.

Solving a multiobjective job shop scheduling problem using Pareto Archived Cuckoo Search

This paper investigates a new approach for solving the multiobjective job shop scheduling problem, namely the Cuckoo Search ( CS) approach. The requirement is to schedule jobs on a single machine so that the total material waste is minimised as well as the total tardiness time. The material waste is quantified in terms of saving factors to show the reduction in material that can be achieved when producing two jobs with the same materials in sequence. The estimated saving factor is used to calculate a cost savings for each job based on its material type. A formulation of multiobjective optimisation problems is adopted to generate the set of schedules that maximise the overall cost savings and minimise the total tardiness time. where all trade-offs are considered for the two conflicting objectives. A Pareto Archived Multiobjective Cuckoo Search (PAMOCS) is developed to find the set ofnondominated Pareto optimal solutions. The solution accuracy of PAMOCS is shown by comparing the closeness of the obtained solutions to the true Pareto front generated by the complete enumeration methad. Results shaw that CS is a very effective and promising technique to solve job shop scheduling problems.

A multi-objective evolutionary algorithm-based decision support system: a case study on job-shop scheduling in manufacturing

In this paper, an evolutionary algorithm is used for developing a decision support tool to undertake multi-objective job-shop scheduling problems. A modified micro genetic algorithm (MmGA) is adopted to provide optimal solutions according to the Pareto optimality principle in solving multi-objective optimisation problems. MmGA operates with a very small population size to explore a wide search space of function evaluations and to improve the convergence score towards the true Pareto optimal front. To evaluate the effectiveness of the MmGA-based decision support tool, a multi-objective job-shop scheduling problem with actual information from a manufacturing company is deployed. The statistical bootstrap method is used to evaluate the experimental results, and compared with those from the enumeration method. The outcome indicates that the decision support tool is able to achieve those optimal solutions as generated by the enumeration method. In addition, the proposed decision support tool has advantage of achieving the results within a fraction of the time.

Escalonamento de um Job Shop : análise de um algoritmo com regras heurísticas

O presente trabalho visa definir um modelo de alocação dos recursos da produção para centros de trabalho em sistemas baseados em job shop, usando a abordagem heurística para garantir uma boa alocação dos recursos. São levados em conta a complexidade de um ambiente de produção, seus aspectos temporais e os modelos de Job Shop Scheduling atualmente em uso. Com isso são examinados os aspectos conceituais deste ambiente e proposto um modelo de alocação de recursos para auxiliar no planejamento operacional do mesmo. Pode-se definir os recursos como todos os elementos necessários à execução das diversas atividades de um processo produtivo, tais como equipamentos, máquinas, mão-de-obra, etc. Por sua vez, os recursos são limitados por natureza, quanto à quantidade de unidades disponíveis, às suas funcionalidades e à capacidade produtiva. O processo de alocação dos recursos pressupõe a designação dos recursos mais satisfatórios para a execução de cada uma das atividades que fazem parte de um projeto. O modelo proposto é baseado no uso de heurísticas para resolver o escalonamento nos centros de trabalho, também chamados de células de produção, usando restrições e regras entre as ordens de fabricação (peças) e as máquinas, para encontrar uma solução satisfatória ao problema. O resultado final é uma ferramenta de apoio à decisão no processo de manufatura, permitindo a visualização do melhor escalonamento de produção, visando a redução do ciclo e setup de produção no processo, com base nas informações locais do ambiente fabril. O sistema está implementado numa empresa de componentes hidráulicos, inicialmente no centro de trabalho de corte, composto por quatro máquinas que realizam o corte de diversos tipos de matérias-primas.

Um modelo de projeto de layout para ambientes job shop com alta variedade de peças baseado nos conceitos da produção enxuta

Segundo Canem e Williamson (1998), o planejamento do layout é importante, pois normalmente representa os maiores e mais caros recursos da organização. Além disso, a localização e disposição física dos equipamentos no chão de fábrica têm impacto em diversos fatores como nível de estoque em processo, tamanho dos lotes de transferência, dificuldade no gerenciamento das atividades, movimentação de pessoas e produtos, entre outros. Portanto, o estudo de conceitos de arranjo físico e o desenvolvimento de modelos de projeto do layout, que visem a otimização dos recursos de produção, são de vital importância na busca pela melhoria dos sistemas produtivos. Neste contexto, este artigo apresenta um novo modelo de projeto de layout, para ambientes job shop com ampla variedade de peças. O modelo foi desenvolvido durante uma pesquisa de doutorado e foi aplicado em algumas empresas do setor metal mecânico. Os resultados obtidos comprovaram a eficiência do modelo projetado. O objetivo do modelo consiste em conduzir a equipe de projeto de layout a desenvolver alternativas de arranjo físico que estejam em consonância com conceitos e princípios da filosofia de produção enxuta. Vale ressaltar novamente que o modelo foi desenvolvido para ambientes com alta variedade de peças, ambientes esses em que, devido à dificuldade em se projetar o arranjo físico, as empresas terminam por adotar o layout funcional, conceito esse de arranjo físico que apresenta sérios problemas como excesso de transporte, altos níveis de estoques em processo, etc.

Algoritmi esatti per il Job Shop Scheduling: approcci Mathematical Programming

In questa tesi ci occuperemo di fornire un modello MIP di base e di alcune sue varianti, realizzate allo scopo di comprenderne il comportamento ed eventualmente migliorarne l’efficienza. Le diverse varianti sono state costruite agendo in particolar modo sulla definizione di alcuni vincoli, oppure sui bound delle variabili, oppure ancora nell’obbligare il risolutore a focalizzarsi su determinate decisioni o specifiche variabili. Sono stati testati alcuni dei problemi tipici presenti in letteratura e i diversi risultati sono stati opportunamente valutati e confrontati. Tra i riferimenti per tale confronto sono stati considerati anche i risultati ottenibili tramite un modello Constraint Programming, che notoriamente produce risultati apprezzabili in ambito di schedulazione. Un ulteriore scopo della tesi è, infatti, comparare i due approcci Mathematical Programming e Constraint Programming, identificandone quindi i pregi e gli svantaggi e provandone la trasferibilità al modello raffrontato.

Stability of an Optimal Schedule for a Job-Shop Problem with Two Jobs

The usual assumption that the processing times of the operations are known in advance is the strictest one in scheduling theory. This assumption essentially restricts practical aspects of deterministic scheduling theory since it is not valid for the most processes arising in practice. The paper is devoted to a stability analysis of an optimal schedule, which may help to extend the significance of scheduling theory for decision-making in the real-world applications. The term stability is generally used for the phase of an algorithm, at which an optimal solution of a problem has already been found, and additional calculations are performed in order to study how solution optimality depends on variation of the numerical input data.

Makespan minimization in a job shop with a batch processing machine

A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm:batch:Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm:: Cmax), which is known to be NP-hard. This research extends the scheduling literature by combining Jm::Cmax with batch processing. The primary contributions are the mathematical formulation, a new network representation and several solution approaches. The problem under study is observed widely in metal working and other industries, but received limited or no attention due to its complexity. A novel network representation of the problem using disjunctive and conjunctive arcs, and a mathematical formulation are proposed to minimize the makespan. Besides that, several algorithms, like batch forming heuristics, dispatching rules, Modified Shifting Bottleneck, Tabu Search (TS) and Simulated Annealing (SA), were developed and implemented. An experimental study was conducted to evaluate the proposed heuristics, and the results were compared to those from a commercial solver (i.e., CPLEX). TS and SA, with the combination of MWKR-FF as the initial solution, gave the best solutions among all the heuristics proposed. Their results were close to CPLEX; and for some larger instances, with total operations greater than 225, they were competitive in terms of solution quality and runtime. For some larger problem instances, CPLEX was unable to report a feasible solution even after running for several hours. Between SA and the experimental study indicated that SA produced a better average Cmax for all instances. The solution approaches proposed will benefit practitioners to schedule a job shop (with both discrete and batch processing machines) more efficiently. The proposed solution approaches are easier to implement and requires short run times to solve large problem instances.

Design and implementation of a web based shop floor control system to maintain schedule feasibility in a dynamic job shop environment

The effective control of production activities in dynamic job shop with predetermined resource allocation for all the jobs entering the system is a unique manufacturing environment, which exists in the manufacturing industry. In this thesis a framework for an Internet based real time shop floor control system for such a dynamic job shop environment is introduced. The system aims to maintain the schedule feasibility of all the jobs entering the manufacturing system under any circumstance. The system is capable of deciding how often the manufacturing activities should be monitored to check for control decisions that need to be taken on the shop floor. The system will provide the decision maker real time notification to enable him to generate feasible alternate solutions in case a disturbance occurs on the shop floor. The control system is also capable of providing the customer with real time access to the status of the jobs on the shop floor. The communication between the controller, the user and the customer is through web based user friendly GUI. The proposed control system architecture and the interface for the communication system have been designed, developed and implemented.

Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

Abstract not available

Heuristics for short route job shop scheduling problems

Abstract not available