Delivery scheduling with variable processing times and due date assignments

DOI10.1007/S40840-025-01856-YMaRDI QIDQ7007150zbMATH OpenFDO

Authors Xuyin Wang, Weiguo Liu

Publication date 26 March 2025

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40840-025-01856-Y

zbMATH Keywords

due date assignmentjust-in-timepast-sequence-dependent delivery timeschedulingsingle-machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
• A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
• Approximation algorithms for scheduling single batch machine with incompatible deteriorating jobs
• Bicriterion scheduling with group technology and deterioration effect
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect
• Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs
• Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
• Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
• Due-window assignment scheduling in the proportionate flow shop setting
• Due-window assignment scheduling problems with position-dependent weights on a single machine
• Earliness-tardiness scheduling with delivery times and deteriorating jobs
• Machine scheduling problems with a position-dependent deterioration
• Minimizing the number of late jobs and total late work with step-learning
• Models and algorithms of time-dependent scheduling
• Multitasking scheduling problems with a common due-window
• No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect
• Permutation flow shop scheduling with makespan objective and truncated learning effects
• Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights
• Research on delivery times scheduling with sum of logarithm processing times-based learning effect
• Research on delivery times scheduling with truncated learning effects
• Research on multiple slack due-date assignments scheduling with position-dependent weights
• Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
• Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
• Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
• Resource allocation flowshop scheduling with learning effect and slack due window assignment
• Scheduling jobs with general truncated learning effects including proportional setup times
• Scheduling jobs with sizes and delivery times on identical parallel batch machines
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
• Scheduling with time-changing effects and rate-modifying activities
• Single machine scheduling with step-learning
• Single machine slack due window assignment and deteriorating jobs
• Single machine SLK/DIF due window assignment problem with general job-dependent positional effect and outsourcing operations
• Single-machine group scheduling with general linear deterioration and truncated learning effects
• Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times
• Single-machine scheduling with mixed due-windows and deterioration effects
• Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
• The due date assignment scheduling problem with the deteriorating jobs and delivery time
• The minmax due-date assignment problem with acceptable lead-times
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

Cited in

(2)

• Study on single-machine group scheduling with convex resource allocations and different due-date assignments
• Minmax delivery completion time scheduling with delivery times and deteriorating jobs

This page was built for publication: Delivery scheduling with variable processing times and due date assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007150)