NDLI: An Algorithm for Complex Product Dynamic Integrated Flexible Scheduling

Content Provider	IEEE Xplore Digital Library
Author	Zhiqiang Xie Shuzhen Hao Lan Lan Jing Yang
Copyright Year	2010
Abstract	Aiming at the dynamic scheduling problem with many products, a virtual processing operation tree is constructed by products with different arriving times. The multi-product dynamic flexible scheduling problem is converted into the virtual single-product flexible scheduling problem. A new hierarchical scheduling algorithm for solving dynamic flexible scheduling problem with constraint between jobs is present in this study. Aiming at the routing problem, short-time strategy and machine-balance strategy are adopted to assign each operation to a machine out of a set of capable machines. And in order to solve the sequencing problem, operations are divided into the dependent operations and the independent ones. To the dependent operations, forward greedy rule is adopted in order to make the completion time of operation as early as possible and the scheduling algorithm of shorten idle time is adopted by analyzing the characteristics of the independent operations. Experiment shows that the proposed algorithm can solve firstly the complex product dynamic flexible scheduling problem with constraints between jobs.
Starting Page	304
Ending Page	308
File Size	330281
Page Count	5
File Format	PDF
ISBN	9781424456420
e-ISBN	9781424456437
DOI	10.1109/ICCMS.2010.85
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-01-22
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Job shop scheduling Computational modeling Computer simulation the scheduling algorithm of shorten idle time dynamic flexible job-shop scheduling virtual processing operation tree Dynamic scheduling Educational institutions Routing Scheduling algorithm Computer science short-time strategy Processor scheduling forward greedy rule
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Notice of RetractionStudy on integrated algorithm of complex multi-product flexible scheduling

Notice of RetractionComplex multi-products dynamic scheduling algorithm with sequence-dependent setup times

Research on just-in-time scheduling

Greedy algorithm solution of flexible flow shop scheduling problem (2009).

Notice of RetractionStudy on Confirming Increasable Bottleneck Device in Complex Product Dynamic Scheduling

A branch-and-bound algorithm for n-job two machine flow shop scheduling problems

Dynamic scheduling of multi-task for hybrid flow-shop based on idle time windows

A Dynamic Scheduling Algorithm for Complex Product with Batching Machines

Integrated production planning and scheduling using backward/forward scheduling simulation

An Algorithm for Complex Product Dynamic Integrated Flexible Scheduling

Similar Documents

Notice of RetractionStudy on integrated algorithm of complex multi-product flexible scheduling

Notice of RetractionComplex multi-products dynamic scheduling algorithm with sequence-dependent setup times

Research on just-in-time scheduling

Greedy algorithm solution of flexible flow shop scheduling problem (2009).

Notice of RetractionStudy on Confirming Increasable Bottleneck Device in Complex Product Dynamic Scheduling

A branch-and-bound algorithm for n-job two machine flow shop scheduling problems

Dynamic scheduling of multi-task for hybrid flow-shop based on idle time windows

A Dynamic Scheduling Algorithm for Complex Product with Batching Machines

Integrated production planning and scheduling using backward/forward scheduling simulation

An Algorithm for Complex Product Dynamic Integrated Flexible Scheduling