An assessment of information systems education needs in Taiwan

International Journal of Information Management145369-384IJMA

A Local Search Using Solution Fragments for the 2-Machine Bi-Criteria Scheduling Problem

In this work, we introduce a local search strategy for combinatorial optimization problems which explores neighborhoods obtained using fragments of current solutions. We apply the approach to the well-known NP -hard 2-machine bicriteria flowshop scheduling problem. Computational experiments using benchmark data show the approach to be effective when compared to other algorithms available for the problem

Two-stage no-wait scheduling models with setup and removal times separated

This paper studies two models of two-stage processing with no-wait in process. The first model is the two-machine flow shop, and the other is the assembly model. For both models we consider the problem of minimizing the makespan, provided that the setup and removal times are separated from the processing times. Each of these scheduling problems is reduced to the Traveling Salesman Problem (TSP). We show that, in general, the assembly problem is NP-hard in the strong sense. On the other hand, the two-machine flow shop problem reduces to the Gilmore-Gomory TSP, and is solvable in polynomial time. The same holds for the assembly problem under some reasonable assumptions. Using these and existing results, we provide a complete complexity classification of the relevant two-stage no-wait scheduling models

Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup

Neste artigo apresenta-se uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup das máquinas separados dos tempos de processamento das tarefas, a qual foi identificada a partir de investigações que foram realizadas sobre as características do problema. Tal propriedade fornece um limitante superior do tempo de máquina parada entre a sua preparação e o início de execução das tarefas. Utilizando a propriedade, o problema original de programação da produção com minimização do makespan pode ser resolvido de maneira heurística por meio de uma analogia com o problema assimétrico do caixeiro-viajante.<br>This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics a structural property is introduced. Such a property provides an upper bound on the idle time of the machines between the setup task and the job processing. As an application of this property, the original scheduling problem with the makespan criterion can be heuristically solved by an analogy with the asymmetric traveling salesman problem