Scheduling technology with complexity cooperation constrains

  • Jingsheng Li*
  • , Aimin Wang
  • , Chengtong Tang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A new kind of scheduling method for the complexity cooperation constrains is build to solve the cooperation problem of hierarchical kit and assembling pull in job shop and assembling production. Aiming to solve this problem, the methods are proposed to support the scheduling progress. The virtual kit process is adopted for assembling scheduling. The job shop and assemblage process unified data model is build, which is based on complex producing constraint by synthetically considering the process relation, production resources, scheduling time, hierarchical kit and other scheduling rules. The hybrid scheduling arithmetic based on heuristics rules is proposed, which is grouped by the positive pull and push-down scheduling arithmetic. In the end the effectiveness of the system is tested and verified by a real instance.

Original languageEnglish
Title of host publicationProceedings of 2010 International Conference on Intelligent Control and Information Processing, ICICIP 2010
Pages606-610
Number of pages5
EditionPART 1
DOIs
Publication statusPublished - 2010
Event2010 International Conference on Intelligent Control and Information Processing, ICICIP 2010 - Dalian, China
Duration: 13 Aug 201015 Aug 2010

Publication series

NameProceedings of 2010 International Conference on Intelligent Control and Information Processing, ICICIP 2010
NumberPART 1

Conference

Conference2010 International Conference on Intelligent Control and Information Processing, ICICIP 2010
Country/TerritoryChina
CityDalian
Period13/08/1015/08/10

Fingerprint

Dive into the research topics of 'Scheduling technology with complexity cooperation constrains'. Together they form a unique fingerprint.

Cite this