Most scheduling research has considered optimizing a single performance measure (criterion). In this paper we consider the problem of scheduling jobs on a single machine when the desirability of a schedule is evaluated using more than one performance measure. The procedures developed here can be used to construct trade-off curves among selected performance measures. The importance of the trade-off curve is that it provides the complete set of possibly optimal solutions for any objective function (cost function) involving only the selected performance measures. With this information, a manager can concentrate on selecting the most preferred schedule from the set. Algorithms are presented for the three two-criteria problems utilizing mean flow time, maximum tardiness, and number of tardy jobs and the three-criteria problem involving all of these criteria. Computational results for the four algorithms are provided. The most striking result is that the number of efficient solutions is very small in comparison to the number of permutation schedules for all three two-criteria problems and only modestly larger for the three-criteria problem. This has the managerial significance that, irrespective of the individual manager's specific trade-offs between the criteria, the number of possibly optimal schedules that need to be considered is relatively small. Several research directions on heuristic approaches, man-machine interactive approaches, computational efficiency, etc. are possible for the type of problem studied. The work reported here has the potential to stimulate research incorporating multiple performance measures in more complex scheduling models.production/scheduling, deterministic job shop, single stage
A number of investigations have been performed with models of machine limited production systems. In the main, the work has centered upon evaluation of alternative queue disciplines. In this paper, a model is proposed for studying systems in which both machines and labor are limiting resources. The proposed model includes several design and control factors which offer promising subjects for research. These factors relate to labor and job assignment procedures and control, labor force training, and system flexibility as determined by equipment purchasing and employment policies. Results are reported for an initial set of experiments in which the labor assignment procedure and the size of the labor force are variables, and for two subsequent sets of experiments in which the labor assignment procedure, the degree of centralized control of labor assignment, the job routing characteristics of the network, and the labor efficiency matrix are variables. Suggestions are given for further research.
This paper reports a set of simulation experiments with a service system model in which labor interchange is possible between service centers. It explores design and control aspects of labor and machine limited systems. A simple model with two service centers and two laborers is employed to explore the relationships among three experimental variables. The variables are the efficiency of labor interchange, the degree of centralized control exercised in labor assignment, and the queue discipline. Both series and job-shop type job routings are studied.
A multi-pass heuristic scheduling procedure developed for job scheduling problems with deterministic processing times is tested with processing times that are random variables. The heuristic procedure, which uses expected processing times, typically generates a delay schedule (i.e., a schedule in which some operations are delayed while the machine to process these operations is kept idle awaiting the arrival of another operation). Simulation is employed to compare the performance of the schedule generated by the heuristic procedure, a nondelay transformation of that schedule, and the nondelay schedules obtained with four single-pass dispatching rules. The criteria employed are fraction of jobs tardy, mean tardiness, variance of tardiness, and maximum tardiness. The delay schedule produced by the heuristic procedure was found to be markedly superior under certain conditions. Under other conditions, the relative performance of the scheduling rules appears highly problem dependent. Implications of these results are discussed with respect to further research.
The classical formulation of the static job shop scheduling problem with job due dates implies that the question of interest to the manager is: What is the best that can be done to meet due dates with fixed resources? Here, two alternative formulations of the problem are proposed; one because of its practical appeal, the other because of its methodological appeal. The latter is used to develop a multi-pass heuristic scheduling procedure aimed at providing a practical tool for attacking any of the three formulations of the problem. This paper describes the basic structure of the scheduling procedure, the machine coding of a specific version of the procedure, and computational experience with a set of test problems ranging in size up to fourteen jobs and seven machines.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.