Single Machine Scheduling with Flow Allowances
From MaRDI portal
Recommendations
- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Single machine common flow allowance scheduling with controllable processing times
- scientific article; zbMATH DE number 563349
- scientific article; zbMATH DE number 946721
Cited in
(42)- Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method
- Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity
- Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- A unified analysis for scheduling problems with variable processing times
- Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times
- Minmax due-date assignment on a two-machine flowshop
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Scheduling problems with effects of deterioration and truncated job-dependent learning
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- Single machine scheduling with truncated job-dependent learning effect
- Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity
- Minmax due-date assignment with a time window for acceptable lead-times
- Single machine common flow allowance scheduling with controllable processing times
- Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times
- Arc-flow approach for single batch-processing machine scheduling
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Resource dependent scheduling with truncated learning effects
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
- A note: minmax due-date assignment problem with lead-time cost
- Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
- Four single-machine scheduling problems involving due date determination decisions
- Scheduling with rejection and a deteriorating maintenance activity on a single machine
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Resource constrained scheduling with general truncated job-dependent learning effect
- Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects
- Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
- A new perspective on single-machine scheduling problems with late work related criteria
- Due-date assignment with acceptable lead-times on parallel machines
- Fifty years of research in scheduling -- theory and applications
- Research on multiple slack due-date assignments scheduling with position-dependent weights
- Single machine minsum and minmax common due date assignment and scheduling problems involving general position-dependent workloads
- The two single-machine scheduling problems with slack due date to minimize total early work and late work
- Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- A unified approach for scheduling with convex resource consumption functions using positional penalties
This page was built for publication: Single Machine Scheduling with Flow Allowances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5690256)
