2005
DOI: 10.1299/jsmec.48.21
|View full text |Cite
|
Sign up to set email alerts
|

Online Scheduling Aiming to Satisfy Due Date for Flexible Flow Shops

Abstract: The simplest method for making a production schedule is dispatch of jobs to idle machine tools. The method has a tendency of making a compact and efficient schedule, however the completion time of a job is not determined till the job is selected as the next job on an idle machine. Then, online scheduling methods have been developed, in which the production schedule is made as a job arrives at a machine. In this paper, an online scheduling method is developed for flexible flow shops under the due-date related c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

2010
2010
2019
2019

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 7 publications
0
2
0
1
Order By: Relevance
“…For the same problem, but with the possibility of stage skipping, [97] and [98] propose alternative dispatching rules and a local search algorithm, respectively. The online version of the same problem, with tardiness criterion, and no buffers, was briefly studied in [186] with dispatching rules. [66] and [182] proposed a set of dispatching rules based heuristics for the 2-stage problem investigated in [62].…”
Section: Heuristicsmentioning
confidence: 99%
“…For the same problem, but with the possibility of stage skipping, [97] and [98] propose alternative dispatching rules and a local search algorithm, respectively. The online version of the same problem, with tardiness criterion, and no buffers, was briefly studied in [186] with dispatching rules. [66] and [182] proposed a set of dispatching rules based heuristics for the 2-stage problem investigated in [62].…”
Section: Heuristicsmentioning
confidence: 99%
“…일반적으로 스케줄링에서 사용하는 목적함수는 평균체 류시간 최소화, 평균지연시간 최소화, 납기지연작업수의 최소화 등이다 [10,11,12] . 또한 작업장의 특성도 단일 기계 스케줄링, 병렬 기계 스케줄링, 오븐과 같은 뱃치 스케줄 링 [5,10] 등과 같이 다양하다.…”
Section: 스케줄러의 개념 설계unclassified
“…This heuristic was compared with several others such as those based on priority rules and the results have proved that this heuristic is interesting. Takaku and Yura [23] proposed a heuristic based on the distribution rules to minimize the total tardiness. Khalouli et al [12] solved the HFS with multicriteria minimization of the total tardiness and advance.…”
Section: Literature Reviewmentioning
confidence: 99%