Intelligent Scheduling is a system-oriented book on scheduling systems. Each chapter describes a scheduling system in terms of the particular scheduling problems being addressed, design assumptions, and the overall paradigm being used. The book is divided into two sections: (1) scheduling methodologies and (2) application case studies. The methodology chapters focus on research systems and scheduling techniques. The application chapters focus on fielded embedded scheduling systems and describe difficulties and lessons learned.
For example, why have Minton have a chapter on the modeling However, many application AIbased approaches garnered success and analysis of the effectiveness issues were not emphasized by the in these particular applications? How of this paradigm, and Miyashita technologists (such as how to present have ORbased approaches done in and Sycara describe a case-based bottleneck information to the user or these same applications? Why are AIbased approach to repair selection.
The article describes a special time-interval balancing in multi-processor scheduling of composite modular jobs. This scheduling problem is close to just-in-time planning approach. First, brief literature surveys are presented on just-in-time scheduling and due-data/due-window scheduling problems. Further, the problem and its formulation are proposed for the time-interval balanced scheduling of composite modular jobs. The illustrative real world planning example for modular home-building is described. Here, the main objective function consists in a balance between production of the typical building modules (details) and the assembly processes of the building(s) (by several teams). The assembly plan has to be modified to satisfy the balance requirements. The solving framework is based on the following: (i) clustering of initial set of modular detail types to obtain about ten basic detail types that correspond to main manufacturing conveyors; (ii) designing a preliminary plan of assembly for buildings; (iii) detection of unbalanced time periods, (iv) modification of the planning solution to improve the schedule balance. The framework implements a metaheuristic based on local optimization approach. Two other applications (supply chain management, information transmission systems) are briefly described.
The available tools and support for building planning and scheduling systems and applications have been steadily improving for decades. At the same time, the scope, scale, and complexity of the problems to be addressed has been increasing. In this column, I discuss several different scheduling applications developed over the past 25 years, and then describe the tools and techniques used in addressing these problems, showing how improved tools simplified (and in some cases enabled) the solution of problems of increasing difficulty.
The operational traffic control problem comes up in a number of different contexts. It involves the coordinated movement of a set of vehicles and has by and large the flavor of a scheduling problem. In trying to apply scheduling techniques to the problem, one notes that this is a job-shop scheduling problem with blocking, a type of scheduling problem that is quite unusual. In particular, we will highlight a condition necessary to guarantee that job-shop schedules can be executed in the presences of the blocking constraint. Based on the insight that the traffic problem is a scheduling problem, we can derive the computational complexity of the operational traffic control problem and can design some algorithms to deal with this problem. In particular, we will specify a very simple method that works well in fast-time simulation contexts.