Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...

We study the problem of non-preemptive scheduling to minimize energy consumption for devices that allow dynamic voltage scaling. Specifically, consider a device that can process jobs in a non-preemptive manner. The input consists of (i) the set R of available speeds of the device, (ii) a set J of jobs, and (iii) a precedence constraint Π among J . Each job j in J , defined by its arrival time a...

Traveling Salesman Problem (TSP) is an NP-hard Problem, which has so many different real life applications. Precedence Constraint TSP (PCTSP) is one specific type of TSP in which precedence is given to some cities. PCTSP also has numerous applications. Genetic Algorithms [1] are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of fittest. This ...

This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...

This paper summarizes the main existing approaches to propagate resource constraints in Constraint-Based scheduling and identifies some of their limitations for using them in an integrated planning and scheduling framework. We then describe two new algorithms to propagate resource constraints on discrete resources and reservoirs. Unlike most of the classical work in scheduling, our algorithms f...

Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry print industry. There exist several metaheuristic algorithms to solve this problem. However, within time limits, those still either find low quality solutions or struggle large problems. In paper...

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computati...

Resource scheduling of construction proposals allows project managers to assess resource requirements, provide costs and analyse potential delays. The Manufacturing, transportation and Assembly (MtA) sectors of precast construction projects are strongly linked, but considered separately during the scheduling phase. However, it is important to evaluate the cost and time impacts of consequential ...

This paper considers the complexity and the correlation of scheduling unit-time jobs on identical parallel machines and unit-time ow-shop scheduling under precedence constraints. It is shown that, in the case of chain-like precedence constraints, the nonpre-emptive parallel-machines problem and the ow-shop problem to minimize maximum or total completion time can be solved in polynomial time, an...