Results 311 to 320 of about 122,671 (350)
Machine Scheduling and Job Shop Scheduling [PDF]
, 2009 This chapter focuses on job shops. There are n jobs and each job visits a number of machines following a predetermined route. In some models a job may visit any given machine at most once and in other models a job may visit each machine more than once. In the latter case it is said that the job shop is subject to recirculation.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Review of Job Shop Scheduling
Journal of the Operational Research Society, 1966This paper discusses the more recent literature on job-shop-like sequencing problems.The types of problems can be broadly classified as "due date" or "minimum make-span" and among the solutions des...
openaire +2 more sources
Cyclic Schedules for Job Shops with Identical Jobs
Mathematics of Operations Research, 1992We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a pre-determined sequence. Each operation can be performed on exactly one machine.
openaire +3 more sources
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
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
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
A Rollout Metaheuristic for Job Shop Scheduling Problems
Annals of Operations Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meloni, C., Pacciarelli, D., Pranzo, M.
openaire +5 more sources
A Grasp for Job Shop Scheduling
2002In 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 +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
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
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
Korea Institute of Information Technology Review, 2013
본 논문은 다항시간 알고리즘이 알려져 있지 않아 NP-완전(NP-complete) 문제로 분류된 생산공정 일정계획문제(Job shop scheduling problem, JSSP)에 대해 다항시간 알고리즘을 제안하였다. JSSP는 n개의 작업과 m개의 기계가 존재하고, 각 작업의 공정수행 순서와 각 공정의 수행시간이 주어진 상태에서 각 작업의 공정 순서와 기계에 투입되는 순서를 모두 만족시키면서 총 작업수행시간을 최소로 하는 해를 찾는 문제이다. 본 논문에서는 다항시간으로 해를 구하기 위해, 첫 번째로 작업 수행 공정별 수행시간으로부터 공정 완료 후 남은시간을 계산하고, 기계별, 공정 순서별로 그룹화시키고, 해당 그룹내에서는 ...
openaire +2 more sources
본 논문은 다항시간 알고리즘이 알려져 있지 않아 NP-완전(NP-complete) 문제로 분류된 생산공정 일정계획문제(Job shop scheduling problem, JSSP)에 대해 다항시간 알고리즘을 제안하였다. JSSP는 n개의 작업과 m개의 기계가 존재하고, 각 작업의 공정수행 순서와 각 공정의 수행시간이 주어진 상태에서 각 작업의 공정 순서와 기계에 투입되는 순서를 모두 만족시키면서 총 작업수행시간을 최소로 하는 해를 찾는 문제이다. 본 논문에서는 다항시간으로 해를 구하기 위해, 첫 번째로 작업 수행 공정별 수행시간으로부터 공정 완료 후 남은시간을 계산하고, 기계별, 공정 순서별로 그룹화시키고, 해당 그룹내에서는 ...
openaire +2 more sources