Models and algorithms of time-dependent scheduling
The book is a monograph about time dependend scheduling, it is the second edition of a monograph of the author from Poznan (Poland) which has been published in 2008 [Time-dependent scheduling. Berlin: Springer (2008; Zbl 1155.90004)]. The book has more than 500 pages organized in 6 parts and can be seen as the ``state of the art of the research results in the field of time dependent scheduling, but also as a reference to the history of more than 60 years of research. Part 1 deals with ``fundamentals, that means the basis for stating scheduling problems is provided, the main solution methods are introduced, starting from well-known algorithms to heuristics and other approximative methods like branch-and-bound. That all is concluded with the complexity classification, mainly the proof of NP-hardness of some scheduling problems. Part 2 is called ``Scheduling models. Here, at first, the classical scheduling models are treated, classical means here that all job processing times are fixed and known in advance. Then the so-called ``modern models are mentioned, here the job processing times may vary over the time, depending on the machine used or the position of the job in the process. At last, the models with time depending processing times are analyzed. Part 3 concentrates on ``Polynomial problems, where single machine, parallel machine models and at last dedicated machine problems (that means here are models like ``flow shop, or ``open shop are solved) are discussed with algorithmic approaches. Part 4 concentrates on NP-hard problems in this field of scheduling. Like in Part 3, also the different single machine, parallel machine and dedicated machine problems are compared. Part 5 looks at the possible algorithms to handle the problems. Besides exact algorithms, her are also approximation schemes, heuristics, greedy algorithms and local search algorithms are provided. Part 6 is called ``Advanced topics and looks at the models with time dependent processing times and additional constraints, like precedence constraints or bi-criteria problems or limited machine availability. Conclusion: The book presents a lot of material for time dependent scheduling, it is full of algorithms (in pseudo-code) and of complexity proofs, it provides a deep insight to the theory and practice of scheduling.
- Conjugate problems in time-dependent scheduling
- Algorithms for dynamic scheduling of unit execution time tasks
- Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function
- Due-window assignment scheduling with learning and deterioration effects
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Due-window assignment scheduling with past-sequence-dependent setup times
- Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
- New results for an open time-dependent scheduling problem
- Scheduling jobs with a V-shaped time-dependent processing time
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Modeling of a scheduling problem with expected availability of resources
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
- A maintenance activity scheduling with time-and-position dependent deteriorating effects
- Approximating schedules
- scientific article; zbMATH DE number 1216183 (Why is no real title available?)
- scientific article; zbMATH DE number 1293734 (Why is no real title available?)
- The influence of platform models on scheduling techniques
- scientific article; zbMATH DE number 6796346 (Why is no real title available?)
- From the Specification to the Scheduling of Time-Dependent Systems
- Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times
- Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity
- Models and algorithms for planning and scheduling problems
- Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
- Approaches to Solving Scheduling with Due-Window Assignment and Deterioration Effects
- Single-machine scheduling problems with job rejection, deterioration effects and past-sequence-dependent setup times
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
- Optimization of scheduling problems with deterioration effects and an optional maintenance activity
- Single machine slack due window assignment and deteriorating jobs
- Knapsack problems with position-dependent item weights or profits
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
- Single-machine time-dependent scheduling with proportional and delivery times
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
- New bounds for single-machine time-dependent scheduling with uniform deterioration
- Dynamic scheduling problems in theory and practice
- Single machine scheduling with step-learning
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
- Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time
- Scheduling with periodic availability constraints to minimize makespan
- Supply chain scheduling with deteriorating jobs and delivery times
- Scheduling in manufacturing with transportation: classification and solution techniques
- Minmax common due-window assignment scheduling with deteriorating jobs
- Single-machine group scheduling with general linear deterioration and truncated learning effects
- Lagrangian relaxation for seru scheduling problem with a time-dependent learning effect
- Theory and methodology of time-dependent scheduling: past, present and future
- Single machine lot scheduling with maintenance activity
- Fifty years of research in scheduling -- theory and applications
- Two-agent scheduling with time-dependent and position-dependent in a flow-shop system
- Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities
- Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
- Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop
- Single-machine scheduling with mixed due-windows and deterioration effects
- Earliness-tardiness scheduling with delivery times and deteriorating jobs
- No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
- Research on multiple slack due-date assignments scheduling with position-dependent weights
- Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs
- Minimizing the number of late jobs and total late work with step-learning
- Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments
- Scheduling problems on parallel dedicated machines with non-renewable resource
- Delivery scheduling with variable processing times and due date assignments
- Single machine minsum and minmax common due date assignment and scheduling problems involving general position-dependent workloads
- Different due-window assignment scheduling with deterioration effects
- Minmax delivery completion time scheduling with delivery times and deteriorating jobs
- Composition orderings for linear functions and matrix multiplication orderings
- Minimizing total weighted late work with step-learning on a single machine
- Improved algorithms for the two-machine flow shop scheduling problem with uncertain setup times to minimize total tardiness
- A review of challenges and solution approaches in smart manufacturing: a view on scheduling in the Industry 4.0 era
- Total weighted completion time scheduling under resource allocation and time-dependent learning effects
- Time-dependent scheduling
This page was built for publication: Models and algorithms of time-dependent scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778893)
