On the public citation graph

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

https://doi.org/10.1007/s12190-021-01607-9

0 signed · 63 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s00521-015-1910-3openalex-snapshot

Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times

inferredcites →https://doi.org/10.1007/s10479-019-03267-2openalex-snapshot

Solving parallel machine problems with delivery times and tardiness objectives

inferredcites →https://doi.org/10.1007/s40995-016-0080-1openalex-snapshot

Single-machine scheduling problems with a learning effect matrix

inferredcites →https://doi.org/10.1016/0305-0548(94)90080-9openalex-snapshot

Scheduling jobs under simple linear deterioration

inferredcites →https://doi.org/10.1016/0360-8352(88)90041-1openalex-snapshot

Single facility scheduling with nonlinear processing times

inferredcites →https://doi.org/10.1016/j.amc.2010.11.037openalex-snapshot

Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

inferredcites →https://doi.org/10.1016/j.amc.2014.09.095openalex-snapshot

Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs

inferredcites →https://doi.org/10.1016/j.apm.2009.04.020openalex-snapshot

A due-date assignment problem with learning effect and deteriorating jobs

inferredcites →https://doi.org/10.1016/j.apm.2011.07.068openalex-snapshot

Single-machine group scheduling with general deterioration and learning effects

inferredcites →https://doi.org/10.1016/j.apm.2012.05.025openalex-snapshot

Single-machine scheduling with convex resource dependent processing times and deteriorating jobs

inferredcites →https://doi.org/10.1016/j.apm.2013.05.025openalex-snapshot

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

inferredcites →https://doi.org/10.1016/j.cie.2010.08.020openalex-snapshot

Single machine common flow allowance scheduling with a rate-modifying activity

inferredcites →https://doi.org/10.1016/j.cor.2020.105126openalex-snapshot

Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing

inferredcites →https://doi.org/10.1016/j.ejor.2006.03.066openalex-snapshot

Single-machine scheduling problems with past-sequence-dependent setup times

inferredcites →https://doi.org/10.1016/j.ijpe.2011.02.029openalex-snapshot

Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine

inferredcites →https://doi.org/10.1016/j.swevo.2020.100765openalex-snapshot

Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times

inferredcites →https://doi.org/10.1016/s0167-5060(08)70356-xopenalex-snapshot

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

inferredcites →https://doi.org/10.1080/00207543.2014.886027openalex-snapshot

Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity

inferredcites →https://doi.org/10.1080/00207543.2015.1056317openalex-snapshot

Due date assignment and scheduling on a single machine with two competing agents

inferredcites →https://doi.org/10.1080/00207543.2017.1400708openalex-snapshot

Single machine scheduling to minimise resource consumption cost with a bound on scheduling plus due date assignment penalties

inferredcites →https://doi.org/10.1080/01605682.2021.1886616openalex-snapshot

Scheduling of step-improving jobs with an identical improving rate

inferredcites →https://doi.org/10.1080/0305215x.2016.1227616openalex-snapshot

Common due date assignment and cumulative deterioration scheduling on a single machine

inferredcites →https://doi.org/10.1080/0305215x.2019.1632303openalex-snapshot

A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

inferredcites →https://doi.org/10.1080/0305215x.2019.1638920openalex-snapshot

Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology

inferredcites →https://doi.org/10.1080/0305215x.2020.1757089openalex-snapshot

Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function

inferredcites →https://doi.org/10.1080/0951192x.2016.1145808openalex-snapshot

A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times

inferredcites →https://doi.org/10.3934/jimo.2013.9.323openalex-snapshot

Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration

inferredcites →https://doi.org/10.3934/jimo.2016042openalex-snapshot

Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4598690openalex-extracted

inferred← citeshttps://doi.org/10.1002/nav.22257openalex-snapshot

Single‐Machine Scheduling With Positional Deadlines, Time Deadlines, and due Date Assignment for Minimizing Total Weighted Tardiness

inferred← citeshttps://doi.org/10.1007/s10878-023-01025-6openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s10878-024-01223-wopenalex-snapshot

Different due-window assignment scheduling with deterioration effects

inferred← citeshttps://doi.org/10.1007/s12190-024-02023-5openalex-snapshot

Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations

inferred← citeshttps://doi.org/10.1007/s12190-024-02052-0openalex-snapshot

Supply chain scheduling with deteriorating jobs and delivery times

inferred← citeshttps://doi.org/10.1007/s12190-024-02090-8openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s12190-024-02306-xopenalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s12190-025-02694-8openalex-snapshot

Minimizing total completion time scheduling problem with ready times and linear deterioration functions of processing times

inferred← citeshttps://doi.org/10.1007/s12597-024-00750-8openalex-snapshot

Optimal policies for minimizing total job completion times and deviations from common due dates in unrelated parallel machine scheduling

inferred← citeshttps://doi.org/10.1007/s40305-023-00511-2openalex-snapshot

Minmax Common Due-Window Assignment Scheduling with Deteriorating Jobs

inferred← citeshttps://doi.org/10.1007/s40314-024-02717-3openalex-snapshot

Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times

inferred← citeshttps://doi.org/10.1007/s40314-024-02753-zopenalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s40314-024-02881-6openalex-snapshot

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

inferred← citeshttps://doi.org/10.1007/s40314-025-03586-0openalex-snapshot

Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines

inferred← citeshttps://doi.org/10.1007/s40314-026-03684-7openalex-snapshot

Minmax delivery completion time scheduling with delivery times and deteriorating jobs

inferred← citeshttps://doi.org/10.1007/s40840-025-01856-yopenalex-snapshot

Delivery Scheduling with Variable Processing Times and Due Date Assignments

inferred← citeshttps://doi.org/10.1016/j.cie.2022.108469openalex-snapshot

A bicriterion single-machine scheduling problem with step-improving processing times

inferred← citeshttps://doi.org/10.1016/j.cie.2024.110240openalex-snapshot

Meta-heuristic algorithms for integrating manufacturing and supply chain functions

inferred← citeshttps://doi.org/10.1016/j.cor.2022.105999openalex-snapshot

Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

inferred← citeshttps://doi.org/10.1080/01605682.2025.2560511openalex-snapshot

Single-machine setup time scheduling with general linear deterioration subject to makespan and total completion time minimization

inferred← citeshttps://doi.org/10.1080/0305215x.2026.2645254openalex-snapshot

Coordinating single-machine scheduling with a general linear deterioration function and maintenance activity: minimizing the makespan

inferred← citeshttps://doi.org/10.1088/1742-6596/2825/1/012013openalex-snapshot

Flexible job-shop scheduling problem based on Markov state decision process

inferred← citeshttps://doi.org/10.1142/s0129054125460013openalex-snapshot

The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines

inferred← citeshttps://doi.org/10.1142/s0217595923500148openalex-snapshot

Research on Delivery Times Scheduling with Sum of Logarithm Processing Times-Based Learning Effect

inferred← citeshttps://doi.org/10.1142/s0217595924500039openalex-snapshot

No-Idle Flow Shop Scheduling with Deteriorating Jobs and Common Due Date Under Dominating Machines

inferred← citeshttps://doi.org/10.1142/s021759592450009xopenalex-snapshot

Earliness-Tardiness Scheduling with Delivery Times and Deteriorating Jobs

inferred← citeshttps://doi.org/10.1155/2022/3780331openalex-snapshot

A Coordination Mechanism for Scheduling Game on Parallel-Batch Machines with Deterioration Jobs

inferred← citeshttps://doi.org/10.3390/math11183983openalex-snapshot

Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments

inferred← citeshttps://doi.org/10.3390/math11194135openalex-snapshot

Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times

inferred← citeshttps://doi.org/10.3390/math12040610openalex-snapshot

Single Machine Scheduling Proportionally Deteriorating Jobs with Ready Times Subject to the Total Weighted Completion Time Minimization

inferred← citeshttps://doi.org/10.3390/math12162522openalex-snapshot

Single-Machine Scheduling with Simultaneous Learning Effects and Delivery Times

inferred← citeshttps://doi.org/10.3390/math13030363openalex-snapshot

Flow Shop Scheduling with Shortening Jobs for Makespan Minimization

inferred← citeshttps://doi.org/10.3390/math9233085openalex-snapshot

The Due Date Assignment Scheduling Problem with Delivery Times and Truncated Sum-of-Processing-Times-Based Learning Effect

inferred← citeshttps://doi.org/10.3934/jimo.2022011openalex-snapshot

Resource allocation scheduling with deteriorating jobs and position-dependent workloads

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.