Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

Rolim, Gustavo Alencar; Nagano, Marcelo Seido

doi:10.1016/j.cie.2020.106803

Cited by 40 publications

(12 citation statements)

References 220 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the first case, this would be reached by a short makespan achieved with h 1 (i.e., favoring it) and a larger one obtained with h 2 (i.e., hindering it). Conversely, for Equation (11), this implies achieving short makespans with h 2 and larger ones with h 1 , thus hindering the latter.…”

Section: Objective Functionsmentioning

confidence: 99%

See 1 more Smart Citation

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

et al. 2021

View full text Add to dashboard Cite

Section: Objective Functionsmentioning

confidence: 99%

“…One may also find the just-in-time variant, where operations within jobs have due dates and where completing an operation either early or late leads to a penalty [10]. Some other examples include the works of [11]- [14].…”

Section: Index Termsmentioning

confidence: 99%

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

et al. 2021

View full text Add to dashboard Cite

“…As many as ten problem instances, i.e., the number of jobs 5,10,15,20,25,30,35,40,45,50, are generated randomly. For each instance, the machine has three modes: slow (mode 1), standard (mode 2), and fast (mode 3).…”

Section: Problem Instance and Parametersmentioning

confidence: 99%

“…A recent survey has been conducted to report the trend in JIT scheduling [29]. Researchers were also interested in single machine JIT scheduling with periodic maintenance [30,31]. A hybrid approach consists of local search, and a genetic algorithm was proposed to solve the single batch JIT scheduling in a chemical factory [32].…”

mentioning

confidence: 99%

Solving Just-in-Time Single Machine Scheduling with Variable Discrete Speed Machine using Hybrid NSGA-II

Kurniawan

Irman

Febianti

et al. 2021

JTI

View full text Add to dashboard Cite

Due to industrialization and population growth, increasing energy demand can lead to energy scarcity because non-renewable resources are primarily used as energy sources. In addition, carbon dioxide gas, the waste of industrialization, can harm the environment. Therefore, environmentally friendly methods are encouraged in the industrial environment as energy preservation and climate change mitigation. This research discusses just-in-time single machine scheduling that takes into account energy consumption. In this research, energy consumption depends on the machine’s speed. The objectives are minimizing the just-in-time (JIT) penalty (the sum of weighted earliness/tardiness) and energy consumption. This research proposed a hybrid NSGA-II with a local search to solve the multi-objective scheduling problem. Thus, solving the JIT single-machine scheduling problem considers energy consumption to conserve energy and increase production efficiency. Numerical experiments demonstrated that the hybrid NSGA-II with local search is more effective than the standard NSGA-II in solving the problem. Therefore, decision-makers can use the scheduling model to select alternative solutions that consider energy and the environment without sacrificing efficiency.

show abstract

“…, where f(•), g(•), and h(•) are nondecreasing functions. Koulamas [23] presented an algorithm for the 1|d Baker and Scudder [24] presented an excellent survey for the initial research situations on both linear E-T and quadratic E-T scheduling problems, whilst a brilliant review of scheduling problems with multiple types of penalties was also provided in [25]. In [26,27], the concept of batch in JIT scheduling problems with different objectives was investigated by several authors.…”

Section: Introductionmentioning

confidence: 99%

Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

Luo

2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this paper, we investigate a static stochastic single machine JIT scheduling problem in which the jobs’ processing times are stochastically independent and follow geometric distributions whose mean is provided, due dates are geometrically distributed with a common mean, and both the unit penalty of earliness/tardiness and the fixed penalty of earliness/tardiness are deterministic and different. The objective is to minimize the expected total penalties for quadratic earliness, quadratic tardiness, and early and tardy jobs. We prove that the optimal schedule to minimize this problem is V-shaped with respect to the ratio of mean processing time to unit tardiness penalty under the specific condition. Also, we show a special case and two theorems related to this JIT scheduling problem under specific situations where the optimal solutions exist. Finally, based on the V-shaped characteristic, a dynamic programming algorithm is designed to achieve an optimal V-shaped schedule in pseudopolynomial time.

show abstract

Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

Cited by 40 publications

References 220 publications

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

Tailoring Job Shop Scheduling Problem Instances Through Unified Particle Swarm Optimization

Solving Just-in-Time Single Machine Scheduling with Variable Discrete Speed Machine using Hybrid NSGA-II

Stochastic Single Machine JIT Scheduling with Geometric Processing Times and Due Dates

Contact Info

Product

Resources

About