NDLI: A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem

Content Provider	Springer Nature Link
Author	Fattahi, Parviz Hosseini, Seyed Mohammad Hassan Jolai, Fariborz
Copyright Year	2012
Abstract	In this paper, a scheduling problem for a two-stage production system including machining operations and assembly operations is studied. In this system, a number of products of different kinds are produced. Each product is assembled with a set of several parts. The first stage is a hybrid flow shop to produce parts. All machines can process all kinds of parts in this stage, but each machine can process only one part at a time. The second stage is a single assembly machine or a single assembly team of workers. The considered objective is to minimize the completion time of all products (makespan). A mathematical modeling is presented, and since this problem has been proved strongly nondeterministic polynomial-time hard, a series of heuristic algorithms based on the basic idea of Johnson algorithm is proposed. Also, two lower bounds is introduced and improved to evaluate the final solution obtained from heuristic algorithms. The numerical experiments are used to evaluate the performance of the proposed algorithms.
Starting Page	787
Ending Page	802
Page Count	16
File Format	PDF
ISSN	02683768
Journal	The International Journal of Advanced Manufacturing Technology
Volume Number	65
Issue Number	5-8
e-ISSN	14333015
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-05-19
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Scheduling Hybrid flow shop Assembly Heuristic Two-stage production system Industrial and Production Engineering Production/Logistics/Supply Chain Mechanical Engineering Computer-Aided Engineering (CAD, CAE) and Design
Content Type	Text
Resource Type	Article
Subject	Industrial and Manufacturing Engineering Control and Systems Engineering Mechanical Engineering Computer Science Applications Software

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

A note on “A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem”

A heuristic algorithm for solving flexible job shop scheduling problem

A novel hybrid genetic algorithm for the open shop scheduling problem

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks

A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem

A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem

Similar Documents

A note on “A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem”

A heuristic algorithm for solving flexible job shop scheduling problem

A novel hybrid genetic algorithm for the open shop scheduling problem

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems

An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

An effective immune algorithm based on novel dispatching rules for the flexible flow-shop scheduling problem with multiprocessor tasks

A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem

A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem