Single Machine Scheduling with Flow Allowances
From MaRDI portal
Publication:5690256
DOI10.1057/jors.1996.155zbMath0863.90079OpenAlexW1972414677MaRDI QIDQ5690256
G. I. Adamopoulos, Costas P. Pappis
Publication date: 15 January 1997
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1996.155
parallel machinessingle machineweighted earliness and tardinessflow allowanceSLK due-date determination
Related Items (35)
Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect ⋮ Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity ⋮ Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ 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 and slack due-date assignment with aging effect and deteriorating maintenance ⋮ 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 ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ 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 ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ Four single-machine scheduling problems involving due date determination decisions ⋮ Minmax due-date assignment on a two-machine flowshop ⋮ Resource constrained scheduling with general truncated job-dependent learning effect ⋮ SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE ⋮ Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Single machine common flow allowance scheduling with controllable processing times ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times ⋮ Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ A unified analysis for scheduling problems with variable processing times ⋮ Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning
This page was built for publication: Single Machine Scheduling with Flow Allowances
