Delivery scheduling with variable processing times and due date assignments (Q7007150)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Delivery scheduling with variable processing times and due date assignments

scientific article; zbMATH DE number 8017292

Language	Label	Description	Also known as
default for all languages	No label defined
English	Delivery scheduling with variable processing times and due date assignments	scientific article; zbMATH DE number 8017292

Statements

instance of

scholarly article

0 references

title

Delivery scheduling with variable processing times and due date assignments (English)

0 references

0 references

0 references

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

0 references

publication date

26 March 2025

0 references

zbMATH Keywords

scheduling

0 references

due date assignment

0 references

single-machine

0 references

past-sequence-dependent delivery time

0 references

just-in-time

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Machine scheduling problems with a position-dependent deterioration

0 references

Scheduling with time-changing effects and rate-modifying activities

0 references

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

0 references

Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent

0 references

Permutation flow shop scheduling with makespan objective and truncated learning effects

0 references

Bicriterion scheduling with group technology and deterioration effect

0 references

Models and algorithms of time-dependent scheduling

0 references

Approximation algorithms for scheduling single batch machine with incompatible deteriorating jobs

0 references

Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs

0 references

Single-machine group scheduling with general linear deterioration and truncated learning effects

0 references

Single machine slack due window assignment and deteriorating jobs

0 references

Single-machine scheduling with mixed due-windows and deterioration effects

0 references

Scheduling jobs with sizes and delivery times on identical parallel batch machines

0 references

A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times

0 references

Parallel-machine scheduling with past-sequence-dependent delivery times and learning effect

0 references

Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times

0 references

Research on delivery times scheduling with sum of logarithm processing times-based learning effect

0 references

Research on delivery times scheduling with truncated learning effects

0 references

Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times

0 references

Optimal due-date assignment problem with learning effect and resource-dependent processing times

0 references

Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation

0 references

Multitasking scheduling problems with a common due-window

0 references

No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines

0 references

Single machine SLK/DIF due window assignment problem with general job-dependent positional effect and outsourcing operations

0 references

Research on multiple slack due-date assignments scheduling with position-dependent weights

0 references

The minmax due-date assignment problem with acceptable lead-times

0 references

Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times

0 references

The due date assignment scheduling problem with the deteriorating jobs and delivery time

0 references

Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect

0 references

Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs

0 references

Earliness-tardiness scheduling with delivery times and deteriorating jobs

0 references

Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect

0 references

Due-window assignment scheduling problems with position-dependent weights on a single machine

0 references

Due-window assignment scheduling in the proportionate flow shop setting

0 references

Proportionate flow shop scheduling with job-dependent due windows and position-dependent weights

0 references

Bicriterion scheduling with truncated learning effects and convex controllable processing times

0 references

Scheduling jobs with general truncated learning effects including proportional setup times

0 references

Research on two-machine flow shop scheduling problem with release dates and truncated learning effects

0 references

A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function

0 references

Resource allocation flowshop scheduling with learning effect and slack due window assignment

0 references

Single machine scheduling with step-learning

0 references

Minimizing the number of late jobs and total late work with step-learning

0 references

Identifiers

zbMATH Open document ID

1560.90065

0 references

DOI

10.1007/S40840-025-01856-Y

0 references

Mathematics Subject Classification ID

90B35

0 references

zbMATH DE Number

8017292

0 references

Sitelinks

Mathematics(1 entry)

mardi Delivery scheduling with variable processing times and due date assignments