Results 341 to 350 of about 199,857 (394)
Some of the next articles are maybe not open access.
1999
Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
openaire +1 more source
Within the great variety of production scheduling problems that exist, the job shop scheduling problem (JSP) is one that has generated the largest number of studies. It has also earned a reputation for being notoriously difficult to solve. Nevertheless, the JSP illustrates at least some of the demands imposed by a wide array of real world scheduling ...
openaire +1 more source
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 +1 more source
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 +1 more source
A Hybrid Cooperative Coevolution Algorithm for Fuzzy Flexible Job Shop Scheduling
IEEE transactions on fuzzy systems, 2019Flexible scheduling is one of the most significant core techniques for intelligent manufacturing systems. Realization of an optimized schedule through flexible resources assignment is critical to the application and popularization of flexible scheduling,
Lu Sun, Lin Lin, M. Gen, Haojie Li
semanticscholar +1 more source
Improved gray wolf optimizer for distributed flexible job shop scheduling problem
Science China Technological Sciences, 2022Xinyu Li +4 more
semanticscholar +1 more source
A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem
Expert systems with applications, 2022Kun Lei +6 more
semanticscholar +1 more source
Korea Institute of Information Technology Review, 2013
본 논문은 다항시간 알고리즘이 알려져 있지 않아 NP-완전(NP-complete) 문제로 분류된 생산공정 일정계획문제(Job shop scheduling problem, JSSP)에 대해 다항시간 알고리즘을 제안하였다. JSSP는 n개의 작업과 m개의 기계가 존재하고, 각 작업의 공정수행 순서와 각 공정의 수행시간이 주어진 상태에서 각 작업의 공정 순서와 기계에 투입되는 순서를 모두 만족시키면서 총 작업수행시간을 최소로 하는 해를 찾는 문제이다. 본 논문에서는 다항시간으로 해를 구하기 위해, 첫 번째로 작업 수행 공정별 수행시간으로부터 공정 완료 후 남은시간을 계산하고, 기계별, 공정 순서별로 그룹화시키고, 해당 그룹내에서는 ...
openaire +1 more source
본 논문은 다항시간 알고리즘이 알려져 있지 않아 NP-완전(NP-complete) 문제로 분류된 생산공정 일정계획문제(Job shop scheduling problem, JSSP)에 대해 다항시간 알고리즘을 제안하였다. JSSP는 n개의 작업과 m개의 기계가 존재하고, 각 작업의 공정수행 순서와 각 공정의 수행시간이 주어진 상태에서 각 작업의 공정 순서와 기계에 투입되는 순서를 모두 만족시키면서 총 작업수행시간을 최소로 하는 해를 찾는 문제이다. 본 논문에서는 다항시간으로 해를 구하기 위해, 첫 번째로 작업 수행 공정별 수행시간으로부터 공정 완료 후 남은시간을 계산하고, 기계별, 공정 순서별로 그룹화시키고, 해당 그룹내에서는 ...
openaire +1 more source
A survey of job shop scheduling problem: The types and models
Computers & Operations Research, 2022Hegen Xiong +3 more
semanticscholar +1 more source
Multiobjective Job Shop Scheduling
1999This 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