A unified analysis for scheduling problems with variable processing times
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 1859291 (Why is no real title available?)
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- A state-of-the-art review on scheduling with learning effects
- A survey of scheduling with controllable processing times
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Common due window size and location determination in a single machine scheduling problem
- Determination of common due window location in a single machine scheduling problem
- Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
- Job-dependent due-window assignment based on a common flow allowance
- Multiagent scheduling. Models and algorithms
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
- Scheduling jobs with truncated exponential learning functions
- Scheduling with time-changing effects and rate-modifying activities
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Single Machine Scheduling with Flow Allowances
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Single machine scheduling with truncated job-dependent learning effect
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- Time-dependent scheduling
- \(CON/SLK\) due date assignment and scheduling on a single machine with two agents
Cited in
(7)- Variants of Multi-resource Scheduling Problems with Equal Processing Times
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads
- Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
- Study on resource allocation scheduling problem with learning factors and group technology
- scientific article; zbMATH DE number 4079152 (Why is no real title available?)
This page was built for publication: A unified analysis for scheduling problems with variable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076372)