Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TSMCC.2008.2007500
Title: | Integrated resource allocation and scheduling in a bidirectional flowshop with multimachine and COS constraints | Authors: | Zhao, Z.Y.J. Lau, H.C. Ge, S.S. |
Keywords: | Flowshop scheduling Multiplemachine Resource allocation |
Issue Date: | 2009 | Citation: | Zhao, Z.Y.J., Lau, H.C., Ge, S.S. (2009). 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 39 (2) : 190-200. ScholarBank@NUS Repository. https://doi.org/10.1109/TSMCC.2008.2007500 | 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. © 2009 IEEE. | Source Title: | IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews | URI: | http://scholarbank.nus.edu.sg/handle/10635/56350 | ISSN: | 10946977 | DOI: | 10.1109/TSMCC.2008.2007500 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.