Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval

Low, Chinyao; Li, Rong-Kwei; Wu, Guan He

doi:10.1155/2016/6124734

Cited by 13 publications

(7 citation statements)

References 44 publications

(69 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

Section: Problem Instance and Parametersmentioning

confidence: 99%

“…It can be implied that although research in single machine JIT scheduling is ubiquitous [27,[35][36][37], there has been no previous research that combines the single machine JIT scheduling with energy consumption attributed to the machine's speed. The difference between the research and the previous research on single machine JIT is the objective function.…”

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

show abstract

“…Scheduling with due date constraint [1,2] has been widely studied in the field of combinatorial optimization, such as minimizing tardiness [3], lateness [4], or the number of late jobs [5]. Among all the criteria related to the due date, late work [6] and early work [7] are a pair of symmetrical objectives, in which the former one indicates the loss once a job is finished after its due date, while the latter one implies the profit when a job starts execution before this time.…”

Section: Introductionmentioning

confidence: 99%

A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date

Cao

Chen

Choi

et al. 2021

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In this note, we revisit two types of scheduling problem with weighted early/late work criteria and a common due date. For parallel identical machines environment, we present a dynamic programming approach running in pseudopolynomial time, to classify the considered problem into the set of binary NP-hard. We also propose an enumeration algorithm for comparison. For two-machine flow shop systems, we focus on a previous dynamic programming method, but with a more precise analysis, to improve the practical performance during its execution. For each model, we verify our studies through computational experiments, in which we show the advantages of our techniques, respectively.

show abstract

“…In addition, the problem of minimizing the costs associated with delays was investigated [7]. In another study, mixed integer linear programming and dynamic programming methods were tested on a large data set in a single machine environment to minimize the total early delay with a common delivery date [8]. One study aimed to minimize the cost penalty function, which includes total early penalties such as delay [9].…”

Section: Introductionmentioning

confidence: 99%

Determining Order Delivery Date by Revenue Approach: A Case Study With Nonwoven Textile Manufacturers in Trc1 Region

Aktürk

Gülseçen

2019

Tekstil Ve Konfeksiyon

View full text Add to dashboard Cite

Non-woven textile materials are used as intermediate raw materials in various sectors such as cleaning, healthcare and automotive. These products are produced based on demand because they are requested in different compositions, colors, and weights. To ensure that the company achieves its objectives, it is necessary to use the capacity efficiently in the non-woven textile technology since it has high investment costs and high production capacity. In this study, a decision support system has been developed for non-woven textile firms so that they can obtain more order revenue. This software application was developed to sort the orders in 7 different ways based on the Moora and linear functions. The total order revenues to be obtained from each ranking and the delivery dates of sorted jobs are calculated and presented to the user to help him/her in the decision-making process. In addition, this software can also record the operator's planned maintenance data. In the present study, the decision support system was run with 27 different production scenarios. In the scenarios, the Moora method and linear function methods put forward more total order revenues than FCFS (First Come First Served) and EDD (Earliest Due Date) methods. As a product that can be used by decision-makers, the present decision support system provides a different point of view to the literature-which generally consists of theoretical studies-on delivery date and order ranking.

show abstract

Minimizing Total Earliness and Tardiness for Common Due Date Single-Machine Scheduling with an Unavailability Interval

Cited by 13 publications

References 44 publications

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

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

A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date

Determining Order Delivery Date by Revenue Approach: A Case Study With Nonwoven Textile Manufacturers in Trc1 Region

Contact Info

Product

Resources

About