Multiprocessor Flow Shop Scheduling Problem with Common due Window

Rong Hwa Huang; Tung Han Yu; Chang Lin Yang

doi:10.4028/www.scientific.net/AMM.284-287.3712

Paper Titles

Evaluating and Benchmarking Productive Performance of Shipping Companies
p.3675

Improving Operability of SmartUAV in Navigable Airspace of Korea
p.3679

Intelligent Decision-Making on Modular Products Using Fuzzy Algorithms
p.3686

The Study on the Functional Element Representations for Bicycles with Creative Characteristics
p.3691

Supply Chain Pricing Strategy for Short-Lived Ramp-Type Demand Models
p.3696

Research on Optimized Problem-Solving Solutions Selection of the Production Process
p.3702

Optimizing Bi-Objective Imperfect Preventive Maintenance Model for Multi-Component System Using a Proposed Improved PSO Algorithm
p.3707

Multiprocessor Flow Shop Scheduling Problem with Common due Window
p.3712

Measuring the Capability for One Process with Spherical Tolerance
p.3717

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 284-287Multiprocessor Flow Shop Scheduling Problem with...

Multiprocessor Flow Shop Scheduling Problem with Common due Window

Abstract:

The objective of scheduling is to maximize capacity utilization, minimize work-in-process inventory and ensure timely delivery. The due windows problem proposes that jobs should only be finished within the time interval that meets customer needs. This research applies integer programming (IP) and ant colony optimization (ACO) to solve due window problems in a flow shop with multiprocessors (FSMP). To improve the performance of jobs within due windows, this research splits them into different numbers of processing lots so they can be processed on more than one machine simultaneously. This shortens the total weighted earliness and tardiness of the jobs. The ACO is applied as a heuristic tool for solving the scheduling problems, and the solution results show that ACO has good validity, robustness and effectiveness.

You might also be interested in these eBooks

Innovation for Applied Science and Technology

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 284-287)

Pages:

3712-3716

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.284-287.3712

Citation:

Cite this paper

Online since:

January 2013

Authors:

Rong Hwa Huang, Tung Han Yu, Chang Lin Yang

Keywords:

Ant Colony Optimization (ACO), Due Window, Multiprocessor Flow Shop

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] E.G. Negenman, Local search algorithms for the multiprocessor flow shop scheduling problem, Eur. J. Oper. Res. 128 (2001) 147-158.

DOI: 10.1016/s0377-2217(99)00354-9

Google Scholar

[2] C. Oğuz, Y. Zinder, Van Ha Do, A. Janiak, M. Lichtenstein, Hybrid flow shop scheduling problems with multiprocessor task systems, Eur. J. Oper. Res. 152 (2004) 115-131.

DOI: 10.1016/s0377-2217(02)00644-6

Google Scholar

[3] F. Sivrikaya-Serifoglu, G. Ulusoy, Multiprocessor task scheduling in multistage hybrid flow shops: A genetic algorithm approach, J. Oper. Res. Soc. 55 (2004) 504-512.

DOI: 10.1057/palgrave.jors.2601716

Google Scholar

[4] C. Low, Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines, Comput. Oper. Res. 32 (2005) 2013-(2025).

DOI: 10.1016/j.cor.2004.01.003

Google Scholar

[5] K.C. Ying, S.H. Lin, Multiprocessor task scheduling in multistage hybrid flow shops: An ant colony system approach, Int. J. Prod. Res. 44 (2006) 3161-3177.

DOI: 10.1080/00207540500536939

Google Scholar

[6] Z.L. Chen, C.Y. Lee, Parallel machine scheduling with a common due window, Eur. J. Oper. Res. 136 (2002) 512-527.

Google Scholar

[7] R.H. Huang, C.L. Yang, Ant Colony System for Job Shop Scheduling with Time Windows, Int. J. Adv. Manuf. Techno. 39 (2008) 151-157.

DOI: 10.1007/s00170-007-1203-9

Google Scholar

[8] B. Yao, C. Yang, J. Hu, J. Yao, J. Sun, An Improved Ant Colony Optimization for Flexible Job Shop Scheduling Problems. Adv. Sci. Lett. 4 (2011) 2127–2131.

DOI: 10.1166/asl.2011.1601

Google Scholar

[9] W.X. Zheng, H. Nagasawa, N. Nishiyama, Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties, Int. J. Prod. Res. 31 (1993) 1611-1620.

DOI: 10.1080/00207549308956812

Google Scholar