Paper Info
Title
Integrated Resource Allocation and Scheduling in a Bidirectional Flowshop With Multimachine and COS Constraints
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.
Year
DOI
Venue
2009
10.1109/TSMCC.2008.2007500
Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions
Keywords
Field
DocType
flow shop scheduling,integer programming,linear programming,multi-agent systems,resource allocation,COS constraints,CPLEX,bidirectional flowshop schedule,critical operation sequence,individual agent scheduling problem,integer programming,integrated resource allocation,linear programming relaxation,multiple job-agents system,operation schedule,Flowshop scheduling,multiple machine,resource allocation
Mathematical optimization,Job shop scheduling,Fair-share scheduling,Computer science,Flow shop scheduling,Integer programming,Resource allocation,Linear programming,Linear programming relaxation,Dynamic priority scheduling
Journal
Volume
Issue
ISSN
39
2
1094-6977
Citations 
PageRank 
References 
3
0.42
11
Authors
3
Name
Order
Citations
PageRank
ZhengYi John Zhao130.42
Hoong Chuin Lau261.60
Shuzhi Sam Ge317010.19