NDLI: DE solution for the earliness/tardiness case of Hybrid Flow-shop Scheduling problem with priority strategy

Content Provider	IEEE Xplore Digital Library
Author	Zhonghua Han Haibo Shi Feng Qiao Lei Yue
Copyright Year	2011
Description	Author affiliation: Shenyang Jianzhu University, Shenyang, China 110168 (Feng Qiao) \|\| Shenyang Institute of Automation, Chinese Academy of Sciences Shenyang, Nanta Street 114#, Shenyang, China (Haibo Shi; Lei Yue) \|\| Shenyang Institute of Automation, Chinese Academy of Sciences Shenyang, Nanta Street 114#, Shenyang, China 110016 (Zhonghua Han)
Abstract	The earliness/tardiness (E/T) case of Hybrid Flow-shop Scheduling problem (HFSP) is an NP hard problem, which is difficult to deal with, however, the local assignment existing in the practical production increases the complexity of this problem. How to solve the combinatorial optimization problem effectively and optimally is still an open issue today. In this paper, differential evolution algorithm (DE) combined with priority strategy is used to solve this E/T scheduling problem. Firstly, DE algorithm is used to make global assignment and obtain each job's process route. Secondly, the operating priority of the jobs in buffer area deduced from the expectation completion sequence is used to direct the local production assignment between stages, then the starting time of each job can be determined. Finally, under the constraints of the due-date, the global optimization with the minimal penalty sum of E/T is obtained. Several scheme comparisons with simulation results show the effectiveness of the proposed method.
Starting Page	12
Ending Page	17
File Size	1243542
Page Count	6
File Format	PDF
ISBN	9780956715708
DOI	10.1109/ICMIC.2011.5973667
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-06-26
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Job shop scheduling Mathematical model Equations Scheduling algorithm Convergence
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

Hybrid PSO/DE solution for the earliness/tardiness case of hybrid flow-shop scheduling problem

Differential Evolution Algorithm for the Earliness/Tardiness Hybrid Flow-shop Scheduling Problem

An Approach for Earliness and Tardiness Scheduling Problems of Flow Shop with Uncertainty

Genetic algorithm for Job Shop Scheduling with Earliness and Tardiness penalties

Hybrid estimation of distribution algorithm for stochastic Job shop scheduling with earliness/tardiness penalty

Constraint programming search procedure for earliness/tardiness job shop scheduling problem.

Genetic algorithm for solving total weighted tardiness and sum of earliness and tardiness penalties of job-shop scheduling problem

Earliness/Tardiness Scheduling Problem under Uncertainty Based on Grey Chance Constrained Programming

Just-in-time preemptive one-machine problem with costs of earliness- tardiness, interruption and work in process: A mathematical programming

DE solution for the earliness/tardiness case of Hybrid Flow-shop Scheduling problem with priority strategy

Similar Documents

Hybrid PSO/DE solution for the earliness/tardiness case of hybrid flow-shop scheduling problem

Differential Evolution Algorithm for the Earliness/Tardiness Hybrid Flow-shop Scheduling Problem

An Approach for Earliness and Tardiness Scheduling Problems of Flow Shop with Uncertainty

Genetic algorithm for Job Shop Scheduling with Earliness and Tardiness penalties

Hybrid estimation of distribution algorithm for stochastic Job shop scheduling with earliness/tardiness penalty

Constraint programming search procedure for earliness/tardiness job shop scheduling problem.

Genetic algorithm for solving total weighted tardiness and sum of earliness and tardiness penalties of job-shop scheduling problem

Earliness/Tardiness Scheduling Problem under Uncertainty Based on Grey Chance Constrained Programming

Just-in-time preemptive one-machine problem with costs of earliness- tardiness, interruption and work in process: A mathematical programming

DE solution for the earliness/tardiness case of Hybrid Flow-shop Scheduling problem with priority strategy