Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 39, Issue 2, 2009, Pages 190-200

  Zhao, ZhengYi John ^a,b   Lau, Hoong Chuin ^a   Ge, Shuzhi Sam ^b  

^a SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Flowshop scheduling; Multiplemachine; Resource allocation

Indexed keywords

AGENTS; CONTINUOUS TIME SYSTEMS; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; INTERNET PROTOCOLS; LINEARIZATION; PLANNING; RESOURCE ALLOCATION; SCHEDULING; TIME DOMAIN ANALYSIS;

CONTINUOUS-TIME; DISCRETE TIME; DISCRETE TIME DOMAINS; FLOW SHOPS; FLOWSHOP SCHEDULING; INDIVIDUAL AGENTS; INTEGRATED RESOURCES; LINEAR PROGRAMMING RELAXATIONS; MACHINE UTILIZATIONS; MULTIPLEMACHINE; OPERATION SCHEDULING; SCHEDULING PROBLEMS; SCHEDULING SUB PROBLEMS;

HEURISTIC METHODS;

EID: 63049088978     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2008.2007500     Document Type: Article

References (20)

1. A. Che and C. Chu, "Multi-degree cyclic scheduling of two robots in a no-wait flowshop," IEEE Trans. Autom. Sci. Eng., vol. 2, no. 2, pp. 173-183, Apr. 2005.
2. J. Adams, E. Balas, and D. Zawack, "The shifting bottleneck procedure for job shop scheduling," Manage. Sci., vol. 34, pp. 391-401, 1988.
3. M. Bartusch, R. H. Mohring, and F. J. Radermacher, "Scheduling project networks with resource constraints and time windows," Ann. Oper. Res., vol. 16, pp. 201-240, 1988.
4. B. B. Li and L. Wang, "A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 3, pp. 576-591, Jun. 2007.
5. E. K. Bish, "A multiple-crane-constrained scheduling problem in a container terminal," Eur. J. Oper. Res., vol. 144, pp. 83-107, 2003.
6. E. K. Bish, F. Y. CHen, Y. T. Leong, B. L. Nelson, J. W. C. Ng, and D. S. Levi, "Dispatching vehicles in a mega container terminal," OR Spectr., vol. 27, no. 4, pp. 491-506, 2005.
7. P. Brucker, "Scheduling and constraint propagation," Discr. Appl. Math., vol. 123, pp. 227-256, 2002.
8. S.D. Wu, E. S. Byeon, and R.H. Storer, "A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness," Oper. Res., vol. 47, no. 1, pp. 113-124, 1999.
9. I. Kacem, S. Hammadi, and P. Borne, "Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic," Math. Comput. Simul., vol. 60, pp. 245-276, 2002.
10. J. R. Jackson, "An extension of Johnson's results on job lot scheduling," Naval Res. Logist. Quart., vol. 3, pp. 201-203, 1956.
11. K. G. Murty, Y. W. Wan, J. Liu, M. M. Tseng, E. Leung, K. K. Lai, and H. W. C. Chiu, "HongKong International Terminal gains elastic capacity using a data-intensive decision-support system," Interfaces, vol. 35, no. 1, pp. 61-75, 2005.
12. E. Kutanoglu and S. D. Wu, "Improving scheduling robustness via pre-processing and dynamic adaptation," IIE Trans., vol. 36, pp. 1107-1124, 2004.
13. H. C. Lau, S. F. Cheng, T. Y. Leong, J. H. Park, and Z. J. Zhao, "Multiperiod combinatorial auction mechanism for distributed resource allocation and scheduling," in Proc. IEEE/ACM/WIC Int. Conf. Intell. Agent Technol. (IAT 2007), pp. 407-411.
14. J. Liu, W. C. Zhong, and L. C. Jiao, "A multiagent evolutionary algorithm for constraint satisfaction problems," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 36, no. 1, pp. 54-73, Feb. 2006.
15. M. Drozdowski, "Scheduling multiprocessor tasks - An overview," Eur. J. Oper. Res., vol. 94, pp. 215-230, 1996.
16. N. Zribi, I. Kacem, A. ElKamel, and P. Borne, "Assignment and scheduling in flexible job-shops by hierarchical optimization," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 37, no. 4, pp. 652-661, Jul. 2007.
17. B. Peter, "Scheduling and constraint propagation," Discr. Appl. Math., vol. 123, pp. 227-256, 2002.
18. A. Pritsker, L.Watters, and P. Wolfe, "Multiproject scheduling with limited resources: A zero-one programming approach," Manage. Sci.: Theory, vol. 16, no. 1, pp. 93-108, 1969.
19. A. P. J. Vepsalainen and T. E. Morton, "Priority rules for job shops with weighted tardiness costs," Manage. Sci., vol. 33, no. 8, pp. 1035-1047, 1987.
20. Z. J. Zhao, T. Y. Leong, S. S. Ge, and H. C. Lau, "Bidirectional flow shop scheduling with multi-machine capacity and critical operation sequencing," in Proc. Int. Symp. Intell. Control (ISIC 2007 , pp. 446-451.