Models and algorithms of time-dependent scheduling
From MaRDI portal
Publication:778893
DOI10.1007/978-3-662-59362-2zbMath1453.90002OpenAlexW3034470636MaRDI QIDQ778893
Publication date: 20 July 2020
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-59362-2
algorithmsheuristicsscheduling problemsdue datescomplexity classificationtime dependent processing times
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (20)
Slack Due-Window Assignment Scheduling Problem with Deterioration Effects and a Deteriorating Maintenance Activity ⋮ 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 ⋮ 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 ⋮ 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 ⋮ New results for an open time-dependent scheduling problem ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Due-window assignment scheduling with learning and deterioration effects ⋮ Resource allocation scheduling with deteriorating jobs and position-dependent workloads ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times
This page was built for publication: Models and algorithms of time-dependent scheduling
