Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

DOI10.1080/0305215X.2018.1519557OpenAlexW2897353798WikidataQ129158418 ScholiaQ129158418MaRDI QIDQ5059190

Baruch Mor

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1519557

zbMATH Keywords

single-machine schedulingminmaxconvex resource allocationcommon due-windowposition-dependent workloads

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Coupled task scheduling with convex resource consumption functions ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Minmax scheduling problems with common due-date and completion time penalty ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Cites Work

• Scheduling a deteriorating maintenance activity and due-window assignment
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Time-dependent scheduling
• Minmax scheduling problems with a common due-window
• 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
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• A survey of scheduling with controllable processing times
• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• A survey on scheduling problems with due windows
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A note on resource allocation scheduling with position-dependent workloads
• Multiagent Scheduling
• Single Machine Scheduling with Flow Allowances

This page was built for publication: Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation