Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

DOI10.1007/s10878-021-00746-wzbMath1485.90046OpenAlexW3159712842MaRDI QIDQ2075458

Baruch Mor

Publication date: 14 February 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00746-w

zbMATH Keywords

single machine schedulingminmaxconvex resource allocationcommon flow-allowanceposition-dependent workloads

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Single machine slack due window assignment and deteriorating jobs

Cites Work

• Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Total absolute deviation of job completion times on uniform and unrelated machines
• Time-dependent scheduling
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time
• Scheduling problems with position dependent job processing times: computational complexity results
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
• Flowshop scheduling with learning effect and job rejection
• A survey of scheduling with controllable processing times
• Minmax scheduling problems with common due-date and completion time penalty
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• CON/SLK due date assignment and scheduling on a single machine with two agents
• A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
• A note on resource allocation scheduling with position-dependent workloads
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
• Multiagent Scheduling
• Single Machine Scheduling with Flow Allowances

This page was built for publication: Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads