Journal ArticleDOI
Job-shop scheduling with multi-purpose machines
Peter Brucker,R. Schlie +1 more
Reads0
Chats0
TLDR
Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job, and a polynomial algorithm is derived.Abstract:
Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment μ of operations to machines letP(μ) be the corresponding job-shop problem andf(μ) be the minimum makespan ofP(μ). How to find an assignment which minimizesf(μ)? For problems with two jobs a polynomial algorithm is derived.read more
Citations
More filters
Journal ArticleDOI
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Weijun Xia,Zhiming Wu +1 more
TL;DR: The results obtained from the computational study have shown that the proposed algorithm is a viable and effective approach for the multi-objective FJSP, especially for problems on a large scale.
Journal ArticleDOI
Effective Neighborhood Functions for the Flexible Job Shop Problem
TL;DR: A reduction of the set of possible neighbours to a subset for which it can be proved that it always contains the neighbour with the lowest makespan and an efficient approach to compute such a subset of feasible neighbours is presented.
Journal ArticleDOI
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
Jie Gao,Linyan Sun,Mitsuo Gen +2 more
TL;DR: This paper developed a hybrid genetic algorithm (GA) that uses two vectors to represent solutions and developed an efficient method to find assignable time intervals for the deleted operations based on the concept of earliest and latest event time.
Journal ArticleDOI
An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
TL;DR: An extended version of the disjunctive graph model is introduced, that is able to take into account the fact that operations have to be assigned to machines, that allows for an integrated approach to the classical job-shop scheduling problem.
Journal ArticleDOI
Tabu search for the job shop scheduling problem with multi-purpose machines
TL;DR: It is shown that an application of tabu search techniques to this problem yields excellent results for benchmark problems and to the hardest problems in combinatorial optimization.
References
More filters
Journal ArticleDOI
Letter to the Editor—A Graphical Approach to Production Scheduling Problems
Journal ArticleDOI
An efficient algorithm for the job-shop problem with two jobs
TL;DR: In this paper, a reduction of the problem to an unrestricted shortest path problem in a special network is constructed in O(n logn) steps wheren is the number of obstacles.
Journal ArticleDOI
A Geometric Model and a Graphical Algorithm for a Sequencing Problem
TL;DR: A geometric model is given for the problem of scheduling N jobs on M machines so that the total time needed to complete the processing of all jobs is minimized and this model leads to a graphical algorithm, the essence of which is the determination of a shortest path between two nodes in a finite network.
Journal ArticleDOI
The complexity of shop-scheduling problems with two or three jobs
TL;DR: In this article, it was shown that the 3/m /J/C max problem with identical routines of jobs and the 3 /5/J/ C max problem are NP-hard.
Journal ArticleDOI
Solution of the Akers-Friedman Scheduling Problem
TL;DR: The solution of the Akers-Friedman production scheduling problem for the case of two parts and m machines (2 × m) is given and the combination of dynamic programming and graphical approaches makes the method of solution especially effective.