3
- https://doi.org/10.1007/978-3-642-58409-1_54
Single-Machine Scheduling with Mixed Precedence Constraints
- Jan 1, 1999
- Eugene Levner +1 more
Abstract
The paper deals with a single machine scheduling problem involving a general precedence structure that permits both ordinary and fuzzy precedence constraints. Feasible schedules are evaluated not only by their cost but also by the degree of satisfaction with their precedence structure. An O(mlogn+ max(n 2, Kn 2))-time algorithm is proposed for finding nondominated solutions of the resulting bi-criteria scheduling problem where n is the number of jobs, k is the number of fuzzy constrains, and m is the total number of precedence constraints.
- # Precedence Constraints
- # Single Machine Scheduling
- # Degree Of Satisfaction
- # Feasible Schedules
- # Time Algorithm
- # Scheduling Problem
- # Bi-criteria Problem
- # Fuzzy Constraints
- # General Structure
- # Number Of Precedence Constraints