An Improved Production Scheduling Algorithm Based on Resource Constraints

2013 ◽  
Vol 455 ◽  
pp. 619-624
Author(s):  
Yan Gao ◽  
Xin Zhang ◽  
Jian Zhong Xu
Keyword(s):  
Production Scheduling ◽  
Resource Constraints ◽  
Critical Path ◽  
Constraint Satisfaction Problem ◽  
Scheduling Algorithm ◽  
Mathematics Model ◽  
Scheduling Problems ◽  
Project Duration ◽  
Aircraft Assembly ◽  
Two Stages

For resource-constrained project scheduling problems, with aircraft assembly as its background, we established its mathematics model as constraint satisfaction problem. An improved critical path scheduling algorithm is proposed, considering the constraints of precedence relations, resource constraints and space constraints, through the two stages of planning, reaching for aircraft assembly task scheduling optimization objectives. Through the given numerical example results show that, when the objective consists in minimizing the project duration, the algorithm has better performance.

scholarly journals Integrated Parametric Graph Closure and Branch-and-Cut Algorithm for Open Pit Mine Scheduling under Uncertainty

Mining ◽  
2022 ◽  
Vol 2 (1) ◽  
pp. 32-51
Author(s):  
Devendra Joshi ◽  
Amol Paithankar ◽  
Snehamoy Chatterjee ◽  
Sk Md Equeenuddin
Keyword(s):  
Production Scheduling ◽  
Resource Constraints ◽  
Deterministic Model ◽  
Open Pit Mine ◽  
Branch And Cut ◽  
Open Pit ◽  
Computational Time ◽  
Scheduling Problems ◽  
Stochastic Production ◽  
Stochastic Production Scheduling

Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops a computationally efficient algorithm to solve open pit production scheduling problems under uncertain geological parameters. The proposed solution approach for production scheduling is a two-stage process. The stochastic production scheduling problem is iteratively solved in the first stage after relaxing resource constraints using a parametric graph closure algorithm. Finally, the branch-and-cut algorithm is applied to respect the resource constraints, which might be violated during the first stage of the algorithm. Six small-scale production scheduling problems from iron and copper mines were used to validate the proposed stochastic production scheduling model. The results demonstrated that the proposed method could significantly improve the computational time with a reasonable optimality gap (the maximum gap is 4%). In addition, the proposed stochastic method is tested using industrial-scale copper data and compared with its deterministic model. The results show that the net present value for the stochastic model improved by 6% compared to the deterministic model.

scholarly journals Discrete-continuous project scheduling with preemptable activities

2016 ◽  
Vol 64 (2) ◽  
pp. 383-393 ◽  
Author(s):  
R. Różycki ◽  
G. Waligóra ◽  
J. Węglarz
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Future Research ◽  
Scheduling Problems ◽  
Feasible Schedule ◽  
Project Duration ◽  
Processing Rate ◽  
Rate Functions ◽  
Continuous Resources ◽  
Increasing Function

Abstract In this paper, discrete-continuous project scheduling problems with preemptable activities are considered. In these problems, activities of a project simultaneously require discrete and continuous resources for their execution. The activities are preemptable, and the processing rate of each activity is a continuous, increasing function of the amount of a single continuous resource allotted to the activity at a time. The problem is to find a precedence- and discrete resource-feasible schedule and, simultaneously, continuous resource allocation that would minimize the project duration. Convex and concave processing rate functions are considered separately. We show that for convex functions the problem is simple, whereas for concave functions a special methodology has to be developed. We discuss the methodology for three cases of the problem: no discrete resource constraints, one discrete resource being a set of parallel, identical machines, and an arbitrary number of discrete resources. In each case we analyze separately independent and precedence-related activities. Some conclusions and directions for future research are given.

Using a Sliding-Frame Approach for Scheduling Large and Complex IT Projects

2011 ◽  
Vol 2 (4) ◽  
pp. 1-13 ◽  
Author(s):  
Yuval Cohen ◽  
Ofer Zwikael ◽  
Arik Sadeh
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Scheduling Large and Complex IT Projects Using Sliding-Frame Approach

2014 ◽  
pp. 1521-1533
Author(s):  
Yuval Cohen ◽  
Arik Sadeh ◽  
Ofer Zwikael
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Scheduling Large and Complex IT Projects Using Sliding-Frame Approach

2012 ◽  
pp. 173-185
Author(s):  
Yuval Cohen ◽  
Arik Sadeh ◽  
Ofer Zwikael
Keyword(s):  
Project Scheduling ◽  
Resource Constraints ◽  
Project Planning ◽  
Rolling Horizon ◽  
Scheduling Problems ◽  
It Projects ◽  
Software Projects ◽  
Project Duration ◽  
Software Companies ◽  
Planning And Management

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Task Scheduling in Multi-Process with Resource Constraints under MG Workflow

2008 ◽  
Vol 33-37 ◽  
pp. 1425-1430
Author(s):  
Feng Xiong ◽  
Yi Ping Yuan ◽  
Yu Ying Wang ◽  
Guang Wen Wang
Keyword(s):  
Task Scheduling ◽  
Resource Constraints ◽  
Critical Path ◽  
Scheduling Algorithm ◽  
Limited Resource ◽  
Workflow Engine ◽  
Priority Rules ◽  
Heuristic Scheduling ◽  
Time Parameters ◽  
Set Up

In manufacturing Grid workflow, multiple tasks share a common and limited resource pool. In order to solve task scheduling in multi-process with resource constraints under MG workflow, the Task-Resource Constrained model is set up to descript the assignment relation between task and resource. The framework of the task scheduling and the scheduling policies are also presented that can readjust the tasks according to the priority rules and the time parameters in the process. Then we present a heuristic scheduling algorithm that includes multiple policies. The heuristic scheduling algorithm will update the critical path of DAG (Direct Acyclic Graph) and the beginning time of post-tasks. MG Workflow engine can dynamically schedule the resources according the task requirement. An example is given to illustrate the method at last.

Construction Multi-Project Scheduling Model Considering Different Resource Allocation Behavior

2012 ◽  
Vol 174-177 ◽  
pp. 2815-2819 ◽  
Author(s):  
Shu Shun Liu ◽  
Wei Tong Chen
Keyword(s):  
Resource Allocation ◽  
Project Scheduling ◽  
Resource Constraints ◽  
Programming Model ◽  
Scheduling Problems ◽  
Resource Assignment ◽  
Allocation Mechanism ◽  
Allocation Policy ◽  
Project Duration ◽  
Project Environment

According to previous researches, an investigation through small to mid-size construction contractors showed that 84% of construction contractors execute their projects in a multi-project environment. In a multi-project environment, scheduling problems with resource constraints are much more complicated than those in a single project. One of the most important factors that influence multi-project scheduling problems is resource allocation policy, depending on the types of resources, which can be defined by the way of resource acquisition and sharing behavior. This paper discusses resource allocation mechanism for construction multi-project scheduling issues, and then presents an optimization-based model to resolve resource allocation problems. This research developed a CP-based (Constraint Programming) model, which is capable of handling different optimization objectives such as minimizing total cost, overall project duration, subject to resource assignment combinations for each activity. Based on research results, the influence of different types of resource quantity on multi-project duration is discussed. Moreover, resource competitive behavior among all projects is recognized. It concludes that the effective increment of critical resources can reduce overall project duration. The major goal of this research is to find the relation among duration-cost-resource in a multi-project environment, and provide systematic information for construction parties when making resource allocation decisions.

Placement of Digital Microfluidic Biochips via a New Evolutionary Algorithm

2021 ◽  
Vol 26 (6) ◽  
pp. 1-22
Author(s):  
Chen Jiang ◽  
Bo Yuan ◽  
Tsung-Yi Ho ◽  
Xin Yao
Keyword(s):  
Evolutionary Algorithm ◽  
Resource Constraints ◽  
Scheduling Algorithm ◽  
Search Space ◽  
Placement Problem ◽  
Heuristic Scheduling ◽  
Microfluidic Biochips ◽  
Feasible Solutions ◽  
Digital Microfluidic ◽  
Operation Scheduling

Digital microfluidic biochips (DMFBs) have been a revolutionary platform for automating and miniaturizing laboratory procedures with the advantages of flexibility and reconfigurability. The placement problem is one of the most challenging issues in the design automation of DMFBs. It contains three interacting NP-hard sub-problems: resource binding, operation scheduling, and module placement. Besides, during the optimization of placement, complex constraints must be satisfied to guarantee feasible solutions, such as precedence constraints, storage constraints, and resource constraints. In this article, a new placement method for DMFB is proposed based on an evolutionary algorithm with novel heuristic-based decoding strategies for both operation scheduling and module placement. Specifically, instead of using the previous list scheduler and path scheduler for decoding operation scheduling chromosomes, we introduce a new heuristic scheduling algorithm (called order scheduler) with fewer limitations on the search space for operation scheduling solutions. Besides, a new 3D placer that combines both scheduling and placement is proposed where the usage of the microfluidic array over time in the chip is recorded flexibly, which is able to represent more feasible solutions for module placement. Compared with the state-of-the-art placement methods (T-tree and 3D-DDM), the experimental results demonstrate the superiority of the proposed method based on several real-world bioassay benchmarks. The proposed method can find the optimal results with the minimum assay completion time for all test cases.

Linear Rail Space Dynamic Scheduling Technology for Multi-Tasking Hybrid Assembly Sections

2012 ◽  
Vol 271-272 ◽  
pp. 650-656
Author(s):  
Zhi Bing Lu ◽  
Ai Min Wang ◽  
Cheng Tong Tang ◽  
Jing Sheng Li
Keyword(s):  
Production Scheduling ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Real Data ◽  
Utilization Rate ◽  
Filter Method ◽  
Scheduling Problem ◽  
Rule Based ◽  
Comprehensive Utilization ◽  
Space Production

For the rapid response to production scheduling problem driven by high-density production tasks, a dynamic scheduling technology for the large precision strip products assembly with a mixture of task time nodes and line-rail space is proposed. A scheduling constrained model containing coverage, proximity, timeliness and resource is established. A linear rail space production scheduling technology using heuristic automatic scheduling and event-driven method is put forward. The time rule based on delivery and single completion assembly is formed, at the same time the space rule based on the adjacent rail and comprehensive utilization is researched. Supposing the privilege of single product assembling as the core, the scheduling parts filter method based on multiple constraints and former rules. For the space layout problem, a clingy forward and backward algorithms is proposed to judge the assemble position regarding the space comprehensive utilization rate. The classification of the various disturbances in the actual production is summarized. Three basic algorithms are proposed, including insertion, moving and re-scheduling algorithm, in order to solve the assembly dynamic scheduling problem driven by production disturbance events. Finally, take rocket as the example， the rocket assembly space production scheduling system is developed, combining with the proposed algorithm. The practicability of the system is validated using real data.

Sign in / Sign up

Export Citation Format

Share Document