Due Date Achievable Verification in Job Shop with Alternative Processes by Timed Automata

Author

Huang, Gang ; Shao, Xinyu ; Li, Peigen

Author_Institution

Sch. of Mech. Sci. & Eng., Huazhong Univ. of Sci. & Technol.

Volume

2

fYear

0

fDate

0-0 0

Firstpage

7229

Lastpage

7233

Abstract

This paper introduces a model to solving the job shop problem with alternative processes and due date by mean of timed automata. A job shop can be modeled as timed automata. If a state of such automata can be reached such that the time of that state does not exceed the given due date and all job have been finished, the due date can be satisfied. Approach to seek the optimize makespan is proposed as well. This model can be extended to suit the cases that some jobs have different due date and the cases that some jobs have release time

Keywords

automata theory; job shop scheduling; just-in-time; process planning; alternative process; due date achievable verification; job due date; job release time; job shop scheduling; makespan optimization; timed automata; Agile manufacturing; Automata; Benchmark testing; Computer integrated manufacturing; Job shop scheduling; Mass customization; Process planning; Qualifications; Research and development; Scheduling algorithm; Alternative processes; Due date achievable verification; Job shop scheduling; Timed automata;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1714489

Filename

1714489