NDLI: Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Content Provider	IEEE Xplore Digital Library
Author	Bareduan, S.A. Hasan, S.H.
Copyright Year	2008
Description	Author affiliation: Fac. of Mech. & Manuf. Eng., Univ. Tun Hussein Onn Malaysia, Batu Pahat, Malaysia (Bareduan, S.A.; Hasan, S.H.)
Abstract	This paper presents a scheduling heuristic to minimize the makespan of a re-entrant flow shop using bottleneck analysis. The heuristic is specifically intended for the cyber manufacturing centre (CMC) which is an Internet-based collaborative design and manufacturing between the Universiti Tun Hussein Onn Malaysia and the small and medium enterprises. The CMC processes scheduling resembles a four machine permutation re-entrant flow shop with the process routing of M1,M2,M3,M4,M3,M4 in which the first process at M1 has high tendency of exhibiting dominant characteristic. It was shown that using bottleneck-based analysis, an effective constructive heuristic can be developed to solve for near-optimal scheduling sequence. At strong machine dominance level and medium to high job numbers, this heuristic shows slightly better makespan performance compared to the NEH. However, for smaller job numbers, NEH is superior.
Starting Page	143
Ending Page	147
File Size	614484
Page Count	5
File Format	PDF
ISBN	9781424426294
DOI	10.1109/IEEM.2008.4737848
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-08
Publisher Place	Singapore
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Bottleneck Job shop scheduling Computer aided manufacturing Heuristic algorithms Routing dominant machine heuristic Scheduling Computer numerical control Scheduling algorithm Manufacturing processes Processor scheduling re-entrant flow shop Collaboration Internet
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

Bottleneck adjacent matching 4 (BAM4) heuristic for re-entrant flow shop with dominant machine

Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines

Makespan Algorithms and Heuristic for Internet-Based Collaborative Manufacturing Process Using Bottleneck Approach

Methodology To Develop Heuristic For Re-Entrant Flow Shop With Two Potential Dominant Machines Using Bottleneck Approach

Clustered absolute bottleneck adjacent matching heuristic for re- entrant flow shop.

Extending the Palmer algorithm to solve group flexible flow-shop problems

Bee Colony Optimization algorithm with Big Valley landscape exploitation for Job Shop Scheduling problems

Integrated GA and AHP for re-entrant flow shop scheduling problem

Heuristic algorithm based on the Crucial Machine for the No-Wait Flow-shop scheduling

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine

Similar Documents

Bottleneck adjacent matching 4 (BAM4) heuristic for re-entrant flow shop with dominant machine

Bottleneck-based heuristic for re-entrant flow shop with two potential dominant machines

Makespan Algorithms and Heuristic for Internet-Based Collaborative Manufacturing Process Using Bottleneck Approach

Methodology To Develop Heuristic For Re-Entrant Flow Shop With Two Potential Dominant Machines Using Bottleneck Approach

Clustered absolute bottleneck adjacent matching heuristic for re- entrant flow shop.

Extending the Palmer algorithm to solve group flexible flow-shop problems

Bee Colony Optimization algorithm with Big Valley landscape exploitation for Job Shop Scheduling problems

Integrated GA and AHP for re-entrant flow shop scheduling problem

Heuristic algorithm based on the Crucial Machine for the No-Wait Flow-shop scheduling

Bottleneck adjacent matching 3 (BAM3) heuristic for re-entrant flow shop with dominant machine