Manpower scheduling means assigning a work pattern (shift day) according to the wants and needs of system workforce with goal minimum cost. Many production service systems require multiple scheduling. This problem is generally NP-complete, it takes long time solve through current method. Today, several innovative methods have been proposed such problems. In this paper, simulated annealing metho...

THE STRUCTURE OF A MODEL / 305 CLASSIFICATIONS OF MODELS / 306 COMMON MODELING TECHNIQUES I 307 Flow (harts / 307 Graph or Network Models / 309 PERT Planning Method / 312 Linear Programming Models / 313 Queueing Models / 314 Arrival Process / 314 Queue Structure / 315 Service System / 315 Measures of Performance / 315 Simulation Models / 316 Case Study 1 : Emergency Service Simulation Model / 3...

This paper presents a novel bi-objective manpower scheduling problem that minimizes the penalty resulted from employees’ assignment at lower skill levels than their real skill and maximizes employees’ utility for working at a special skill level in some shifts or on some days. Employees are classified in two specialist groups and three skill levels in each specialization. In addition, the prese...

A major challenge in the area of global market economy is to develop new techniques for solving real world scheduling, planning, logistic and resource allocation problems. Indeed, any industrial organisation can only be economically viable by maximising customer services, maintaining efficient, low cost operations and minimising total investment. Significant domains exhibiting these characteris...

Manpower is a highly critical resource in many industries. It is not surprising that organizations place substantial investment into manpower management matters. Manpower rostering, which addresses the issues of employing, allocating and scheduling manpower resources to meet operational demands, is at the heart of the manpower management cycle. Rostering is a particularly prominent activity i...

Scheduling problems are often modeled as resource constrained problems in which critical resource assignments to tasks are known and the best assignment of resource time must be made subject to these constraints. Generalization to resource scheduling, where resource assignments are chosen concurrently with times results in a problem which is much more di±cult. A simpli ̄ed model of the general r...

Ideally, the solution to job-shop scheduling problem (JSP) should effectively reduce cost of manpower and materials, thereby enhancing core competitiveness manufacturer. Deep learning (DL) neural networks have certain advantages in handling complex dynamic JSPs with a massive amount historical data. Therefore, this paper proposes model based on DL. Firstly, data prediction was established for s...

Scheduling problems are often modeled as resource constrained problems in which critical resource assignments to tasks are known and the best assignment of resource time must be made subject to these constraints. Generalization to resource scheduling, where resource assignments are chosen concurrently with times results in a problem which is much more di cult. A simpli ed model of the general r...

A multi-objective simulated annealing (MOSA) algorithm is described in this chapter to solve a real maintenance workforce scheduling problem (MWSP) aimed at simultaneously minimizing the workforce cost and maximizing the equipment availability. Heavy industry maintenance facilities at aircraft service centres, railroad yards and steel companies must contend with scheduling Preventive Maintenanc...