Constraint-based scheduling: a recursive approach

The authors introduce the idea of constraint-based scheduling and consider some constraints as a good factor in scheduling. The idea is used to develop a novel scheduling method. A schedule problem is used to present the method. The parallel-serial plan (PSP) is defined. A recursive approach to find the best scheduling for a PSP is outlined. The complexity of the algorithm is discussed, and the algorithm is extended for the scheduling of a plan. >

Authors

• Jiaxin Wang
• Pierre Gaspart

Keywords

• Processor scheduling
• Scheduling algorithm
• Computer science
• Paper technology
• Production planning
• Availability
• Costs
• Production systems
• Start Time
• Set Of Operations
• Partial Order
• Tardiness
• Search Range
• Scheduling Method
• Scheduling System
• Numbers In Brackets
• Precedence Constraints
• Kinds Of Constraints
• Regularization Algorithm