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

Authors:
ZhengYi John Zhao;Hoong Chuin Lau;Shuzhi Sam Ge
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, Singapore and School of Information Systems, Singapore Management University, Singapore;School of Information Systems, Singapore Management University, Singapore;Department of Electrical and Computer Engineering, National University of Singapore, Singapore
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Year:
2009

Citing 10
Cited 0

Priority rules for job shops with weighted tardiness costs

Management Science
The shifting bottleneck procedure for job shop scheduling

Management Science
Scheduling project networks with resource constraints and time windows

Annals of Operations Research
A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness

Operations Research
Scheduling and constraint propagation

Discrete Applied Mathematics
Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System

Interfaces
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling

IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A multiagent evolutionary algorithm for constraint satisfaction problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An integer programming (IP) model is proposed for integrated resource allocation and operation scheduling for a multiple job-agents system. Each agent handles a specific job-list in a bidirectional flowshop. For the individual agent scheduling problem, a formulation is proposed in continuous time domain and compared with an IP formulation in discrete time domain. Of particular interest is the formulation of the machine utilization function-- both in continuous time and discrete time. Fast heuristic methods are proposed with the relaxation of the machine capacity. For the integrated resource allocation and scheduling problem, a linear programming relaxation approach is applied to solve the global resource allocation and a fast heuristic method is applied to solve each scheduling subproblem. The proposed solution is compared experimentally with that from the integer programming solver by CPLEX.