Variable intensity RCPSP approach to a case study flow shop
Abstract
Presented in this work is the development of a simulation modelling and solution approach for the scheduling problem of a case study company which can be classified as a project based flow shop. The problem is formulated as a Resource Constrained Project Scheduling Problem (RCPSP) and solved with a variable intensity approach. Binary decision variables are used in determining the projects to be executed on a periodic basis at the operations involved, followed by the application of a capacity allocation algorithm for determining the proportion of operational capacity to dedicate to each project. Also, a feeding precedence relation is applied for modelling the overlap that exists between two of the operations involved in the system.
The work is part of the development of the various modules of a simulation based decision support system. The simulation modelling and solution methodology developed here are for implementation in its simulation module, which is an open-source simulation modelling package.
References
[1]
Dagkakis, G., et al. From COTS Simulation Software to an Open-source Platform: A Use Case in the Medical Device Industry, Procedia CIRP 25, (2014), 283--292.
[2]
Olaitan, O., et al. Implementing ManPy, a Semantic-free Open-source Discrete Event Simulation Package, in a Job Shop, Procedia CIRP 25, (2014), 253--260.
[3]
Rotondo, A., et al. Simulation-based Decision Support Tools for Demand Disaggregation in a Supply Chain Characterised by High Routing Flexibility, Procedia CIRP 25, (2014), 261--268.
[4]
Alfieri, A., Tolio, T., and Urgo, M. A project scheduling approach to production and material requirement planning in Manufacturing-to-Order environments, J. Intell. Manuf. 23, 3 (2012), 575--585.
[5]
Leachman, R. C., Dtncerler, A., and Kim, S. Resource-Constrained Scheduling of Projects with Variable-Intensity Activities, IIE Transactions 22, 1 (1990), 31--40.
[6]
Kis, T. A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, Math. Program. 103, 3 (2005), 515--539.
[7]
Váncza, J., Kis, T., and Kovács, A. Aggregation - the key to integrating production planning and scheduling", CIRP Ann. Manuf. Technol. 53, 1 (2004), 377--380.
[8]
Kolisch, R., and Padman, R. An integrated survey of deterministic project scheduling, Omega 29, 3 (2001), 249--272.
[9]
Hartmann, S., and Briskorn, D. A survey of variants and extensions of the resource-constrained project scheduling problem, Eur. J. Oper. Res. 207, 1 (2010), 1--14.
[10]
Kolisch, R., and Hartmann, S. Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis, In J. Weglarz, ed., 14, Springer US (1999), 147--178.
[11]
Nonobe, K., and Ibaraki, T. Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem, In C. C. Ribeiro and P. Hansen, eds., 15, Springer US (2002), 557--588.
[12]
Brucker, P., et al. Resource-constrained project scheduling: Notation, classification, models, and methods, Eur. J. Oper. Res. 112, 1 (1999), 3--41.
[13]
Bianco, L., and Caramia, M. Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm, OR 10, 4 (2012), 361--377.
[14]
Alfieri, A., Tolio, T., and Urgo, M. A project scheduling approach to production planning with feeding precedence relations, Int J Prod Res 49, 4 (2011), 995--1020.
[15]
Elmaghraby, S. E., and Kamburowski, J. The Analysis of Activity Networks under Generalized Precedence Relations (GPRs), Management Science 38, 9 (1992), 1245--1263.
[16]
Kis, T. RCPS with Variable Intensity Activities and Feeding Precedence Constraints, in J. Jozefowska and J. Weglarz, eds., 92, Springer US (2006), 105--129.
[17]
Tolio, T., Urgo, M., and Alfieri, A. Project Scheduling with variable intensity activities and feeding precedence relations: an application to production planning in Manufacturing-to-order environments, In Proceedings of ESDA 2008, 9th biennial ASME conference on engineering systems design and analysis. (2008).
[18]
Egri, P., et al. Project-Oriented Approach to Production Planning and Scheduling in Make-to-Order Manufacturing, Production Systems and Information Engineering 2, (2004), 23--36.
[19]
Kolisch, R. Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies, Int J Prod Econ 64, 1--3 (2000), 127--141.
[20]
Mohanty, R. P., and Siddiq, M. K. Multiple projects --- Multiple resources constrained scheduling: A multiobjective analysis, Engineering Costs and Production Economics 18, 1 (1989), 83--92.
[21]
Icmeli, O., and Erenguc, S. S. A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows, Comput. Oper. Res. 21, 8 (1994), 841--853.
[22]
Hartmann, S. A competitive genetic algorithm for resource-constrained project scheduling, Naval Research Logistics (NRL) 45, 7 (1998), 733--750.
[23]
Bouleimen, K., and Lecocq, H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, Eur. J. Oper. Res. 149, 2 (2003), 268--281.
[24]
Norbis, M., and MacGregor Smith, J. An interactive decision support system for the resource Constrained Scheduling Problem, Eur. J. Oper. Res. 94, 1 (1996), 54--65.
[25]
Hapke, M., Jaszkiewicz, A., and Słowiński, R. Interactive analysis of multiple-criteria project scheduling problems, Eur. J. Oper. Res. 107, 2 (1998), 315--324.
[26]
Nabrzyski, J., and Weglarz, J. A knowledge-based multiobjective project scheduling system, Journal of Decision Systems 3, 3 (1994), 185--200.
[27]
Chen, J. F., and Wilhelm, W. E. An evaluation of heuristics for allocating components to kits in small-lot, multi-echelon assembly systems, Int J Prod Res 31, 12 (1993), 2835--2856.
Index Terms
- Variable intensity RCPSP approach to a case study flow shop
Recommendations
Scheduling a single server in a two-machine flow shop
We study the problem of scheduling a single server that processes n jobs in a two-machine flow shop environment. A machine dependent setup time is needed whenever the server switches from one machine to the other. The problem with a given job sequence ...
Flow shop scheduling with two distinct job due dates
Highlights- Flow shop scheduling problems with two distinct job due dates.
- Solvability with ...
AbstractWe consider flow shop scheduling problems with two distinct job due dates. Motivated by the NP-hardness of these problems with arbitrary job processing times, we focus on their solvability with ordered or proportionate job processing ...
Comments
Information & Contributors
Information
Published In
July 2015
549 pages
ISBN:9781510810594
- Co-chair:
- Floriano De Rango,
- Editors:
- Saurabh Mittal,
- Il-Chul Moon,
- Eugene Syriani,
- Program Chair:
- José Luis Risco Martín,
- Publications Chair:
- Deniz Cetinkaya
Sponsors
- SIGSIM: ACM Special Interest Group on Simulation and Modeling
- SCS: Society for Modeling and Simulation International
Publisher
Society for Computer Simulation International
San Diego, CA, United States
Publication History
Published: 26 July 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SummerSim '15
Sponsor:
- SIGSIM
- SCS
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 41Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in