An interactive procedure for bi-criteria production scheduling. (English) Zbl 0810.90052
Summary: A scheduling problem is analyzed in which the schedular desires to minimize both the tardiness of the jobs and the incurred set-up costs. Unlike existing bi-criteria scheduling formulations, the approach developed in this paper does not utilize a weighted objective function. Because the application studied is dynamic in that the importance of each criteria varies over time, an interactive approach is developed that allows the decision maker to evaluate the job assignments. By analyzing simulations of the applications, the procedure is shown to be efficient in that the elapsed time between the decision maker’s input and the system’s response was within 5.3 sec. Furthermore, the system was able to reduce the number of feasible sequences by an average of 55% which allowed a decision to be made in six or fewer iterations.
References:
| [1] | Jain, S. K., A simulation-based scheduling and management information system for a machine shop, Interface, 6, 81-96 (November 1978) |
| [2] | Smith, W. E., Various optimizers for single-stage production, Naval Res. logist. Q., 3, 59-66 (1956) |
| [3] | Baker, K. R., Introduction to Sequencing and Scheduling (1974), Wiley: Wiley New York |
| [4] | Van Wassenhove, L. N.; Gelders, L. F., Solving a bicriterion scheduling problem, Europ. J. Op. Res., 4, 42-48 (1980) · Zbl 0418.90054 |
| [5] | Van Wassenhove, L. N.; Baker, K. R., A bicriterion approach to time/cost trade-offs in sequencing, Europ. J. Op. Res., 11, 48-54 (1982) · Zbl 0482.90043 |
| [6] | Lin, K. S., Hybrid algorithm for sequencing with bicriteria, J. Optimization Theory Applic., 39 (1983) · Zbl 0479.90051 |
| [7] | Nelson, Rosser T.; Sarin, Rakesh K.; Daniels, Richard L., Scheduling with multiple performance measures: the one-machine case, Mgmt Sci., 32, 464-479 (April 1986) · Zbl 0603.90070 |
| [8] | Sen, T.; Raiszadeh, Forhad M. E.; Dileepan, Parthasarati, A branch-and-bound approach to the bicriterion scheduling problem involving total flowtime and range of lateness, Mgmt Sci., 34, 254-260 (February 1988) · Zbl 0638.90056 |
| [9] | Bernardo, John J.; Lin, K. S., An optimal tardiness algorithm for scheduling \(N\) jobs on \(M\) processors, Adv. Mgmt Studies, 1, 291-307 (1982) |
| [10] | Bernardo, J. J.; Lin, K. S., Scheduling independent jobs on nonuniform unequal processors, J. Ops Mgmt, 4, 305-313 (August 1984) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
