Showing 1 - 10 of 12
Persistent link: https://www.econbiz.de/10014328001
Persistent link: https://www.econbiz.de/10012050928
Persistent link: https://www.econbiz.de/10014265739
In this paper, we deal with the problem of sequencing parts and robot moves in a robotic cell where the robot is used to feed machines in the cell. The robotic cell, which produces a set of parts of the same or different types, is a flow-line manufacturing system. Our objective is to maximize...
Persistent link: https://www.econbiz.de/10014047541
Flexible transfer lines or mixed-model assembly lines are capable of diversified small-lot production due to negligible switch-over costs. With these lines, it is possible to implement just-in-time (JIT) production, which involves producing only the necessary parts in the necessary quantities at...
Persistent link: https://www.econbiz.de/10014047542
A job-shop with two machine centers with the second one consisting of k parallel machines is considered. An approximate algorithm for minimizing schedule length in the job shop with unit time operations in the first machine center and k time-units operations in the second is proposed. The...
Persistent link: https://www.econbiz.de/10014191821
This note formulates an assignment problem for obtaining optimal level schedules for mixed-model assembly lines in JIT production systems. The problem was formulated as a quadratic integer programming problem in a recent paper by Miltenburg (1989) where, however, only enumerative algorithms and...
Persistent link: https://www.econbiz.de/10012746783
A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...
Persistent link: https://www.econbiz.de/10012746786
The ultimate purpose of our analysis is to show that for any class of linear combinatorial problems assumed to be NP-hard, the class of their strictly nonlinear counterparts is also NP-hard. In this paper, we set the framework, and prove the result for a class of linear integer programming...
Persistent link: https://www.econbiz.de/10012746787
We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [...
Persistent link: https://www.econbiz.de/10012746789