Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine

In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure

Minimizing Mean Tardiness Subject To Unspecified Minimum Number Tardy For A Single Machine

In this paper we propose a hybrid branch and bound algorithm for solving the problem of minimizing mean tardiness for a single machine problem subject to minimum number of tardy jobs. Although the minimum number of tardy jobs is known, the subset of tardy job is not known. The proposed algorithm uses traditional branch and bound scheme where lower bounds on mean tardiness are calculated coupled with using the information that the number of tardy jobs is known. It also uses an insertion algorithm which determines the optimal mean tardiness once the subset of tardy jobs is specified. An example is solved to illustrate the developed procedure

One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal

One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal

One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy

In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal

Stochastic Simulation Model For Maintenance Manpower Planning

In this paper the elements of a generic conceptual simulation maintenance are briefly presented. The conceptual model consists of seven modules. The modules are the input, load, planning and scheduling, material and spare parts, equipment, quality control and performance measures. The conceptual model has been transformed into a simulation model and implemented using AweSirn Simulation language. The model is used for maintenance manpower planning and evaluation of the need for contract maintenance in a process plant in Saudi Arabia. The results indicated that that the simulation model is realistic and a valuable tool for planning manpower in maintenance system systems