http://web.nchu.edu.tw/pweb/users/arborfish/lesson/8682.pdf

A survey of variants and extensions of the resource-constrained project scheduling problem

Personnel scheduling: A literature review

Project scheduling with finite or infinite number of activity processing modes – A survey

Application of robotics in offshore oil and gas industry- A review Part II

Analysis on supply chain risks in Indian apparel retail chains and proposal of risk prioritization model using Interpretive structural modeling

We study an assignment type resource-con- strained project scheduling problem with resources being multi-skilled personnel to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective cut-generating scheme based on temporal analysis in project scheduling is devised for resolving resource conflicts. The computational study shows that our hybrid MILP/CP algorithm is both effective and efficient compared to the pure MILP or CP method alone.

/pdf/scheduling-projects-with-multi-skilled-personnel-by-a-hybrid-1t9gerey8y.pdf

Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm

Optimizing the Supply Chain Configuration for Make-To-Order Manufacturing

Modeling the supply chain configuration problem with resource constraints

: This paper presents a model and procedure for determining crew composition for a new technology like the Navy's DDX. Here the prototype DDX manpower scheduling problem is modeled as a project scheduling problem with multi-purpose resources (PSMPR) where multi-skilled sailors form teams to accomplish interrelated onboard tasks. A hybrid decomposition algorithm that incorporates constraint programming (CP) and a tabu search (TS) metaheuristic is developed for solving this NP-hard problem. In computational experiments, the performance of our hybrid algorithm is tested and compared with solutions found using mixed-integer linear programming (MILP) with CPLEX and with lower bounds obtained from a bin packing problem with conflicts (BPC).

/pdf/a-decomposition-approach-for-shipboard-manpower-scheduling-3a6awaff5r.pdf

A Decomposition Approach for Shipboard Manpower Scheduling

Scheduling with arbitrary due dates and no idle time permitted between jobs with the objective of minimizing the total earliness and tardiness has a variety of industry applications. We review mathematical programming formulations for single and parallel machine problems with fixed and controllable processing and setup times. Weaknesses of the formulations are identified, corrections and/or improvements are provided, and further research directions are suggested.

Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension

Keith Womer

Papers

Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm

Optimizing the Supply Chain Configuration for Make-To-Order Manufacturing

Modeling the supply chain configuration problem with resource constraints

A Decomposition Approach for Shipboard Manpower Scheduling

Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension