Results 341 to 350 of about 137,584 (378)

Genetic algorithms and job shop scheduling

Computers & Industrial Engineering, 1990
Abstract We describe applications of Genetic Algorithms (GAs) to the Job Shop Scheduling (JSS) problem. More specifically, the task of generating inputs to the GA process for schedule optimization is addressed. We believe GAs can be employed as an additional tool in the Computer Integrated Manufacturing (CIM) cycle.
Biegel, John E., Davern, James J.
openaire   +3 more sources

Job Shop Scheduling

1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
openaire   +2 more sources

Job-Shop Scheduling by Implicit Enumeration

Management Science, 1977
The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work. A general bounding approach is developed which includes all previously presented lower bounds as special cases. The strongest bound obtainable in this way
B. J. Lageweg, J. K. Lenstra, A. H. G. Rinnooy Kan   +2 more
openaire   +2 more sources

A Rollout Metaheuristic for Job Shop Scheduling Problems

Annals of Operations Research, 2004
In this paper we deal with solution algorithms for a general formulation of the job shop problem, called alternative graph. We study in particular the job shop scheduling problem with blocking and/or no-wait constraints. Most of the key properties developed for solving the job shop problem with infinite capacity buffer do not hold in the more general ...
Meloni, C., Pacciarelli, D., Pranzo, M.
openaire   +4 more sources

A Grasp for Job Shop Scheduling

2002
In this paper, we describe a greedy randomized adaptive search procedure (GRASP) for the job shop scheduling problem (JSP). We incorporate to the conventional GRASP two new concepts: an intensification strategy and POP (Proximate Optimality Principle) in the construction phase. These two concepts were first proposed by Fleurent and Glover (1999) in the
S. Binato, Mauricio G. C. Resende, W. J. Hery, David Loewenstern   +3 more
openaire   +2 more sources

Multiobjective Job Shop Scheduling [PDF]

, 1999
This chapter demonstrates the use of nondominated sorting GAs to schedule multiobjective job shops (JSP). The illustration uses a JSP involving three separate management objectives: (1) minimization of makespan, (2) minimization of mean flow time, and also (3) minimization of the mean tardiness of jobs.
openaire   +1 more source

Complex Job-Shop Scheduling

2011
This chapter is devoted to another important basic scheduling problem: the jobshop problem. This problem is a special case of the RCPSP where only disjunctive resources (machines) and special precedence constraints in form of chains are given. After giving a precise formulation of the job-shop problem in Section 4.1, solution algorithms are discussed ...
Peter Brucker, Sigrid Knust
openaire   +2 more sources

Job Shop Scheduling Algorithm

Korea Institute of Information Technology Review, 2013
본 논문은 다항시간 알고리즘이 알려져 있지 않아 NP-완전(NP-complete) 문제로 분류된 생산공정 일정계획문제(Job shop scheduling problem, JSSP)에 대해 다항시간 알고리즘을 제안하였다. JSSP는 n개의 작업과 m개의 기계가 존재하고, 각 작업의 공정수행 순서와 각 공정의 수행시간이 주어진 상태에서 각 작업의 공정 순서와 기계에 투입되는 순서를 모두 만족시키면서 총 작업수행시간을 최소로 하는 해를 찾는 문제이다. 본 논문에서는 다항시간으로 해를 구하기 위해, 첫 번째로 작업 수행 공정별 수행시간으로부터 공정 완료 후 남은시간을 계산하고, 기계별, 공정 순서별로 그룹화시키고, 해당 그룹내에서는 ...
openaire   +2 more sources

Resource Scheduling in Edge Computing: A Survey

IEEE Communications Surveys and Tutorials, 2021
Changle Li, Guanghui Li, Quyuan Luo
exaly  

Job shop scheduling

Production Engineer, 1976
openaire   +4 more sources