Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times

Ji, Min; Yao, Danli; Ge, Jiaojiao; Cheng, T.C.E.

doi:10.1504/ejie.2015.074380

Cited by 10 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Gharbi et al (2015) explored a scheduling problem of single machine considering due dates, multiple planned unavailability time periods and job release date; and offered an algorithm to solve it. Ji et al (2015) illuminated scheduling problem of a single-machine to reduce an aggregate cost that included the SLK due-window assignment, earliness, tardiness, and entire resource expenses. The authors showed that the optimal solution can be obtained considering dual resource consumption models which are functions of the job processing period.…”

Section: Scheduling Problemsmentioning

confidence: 99%

Ranking of sequencing rules in a job shop scheduling problem with preference selection index approach

Bari¹,

Karande²

2022

J. Decis. Anal. Int. Comp.

View full text Add to dashboard Cite

Scheduling different jobs in an appropriate sequence are very important in manufacturing industries due to the influence of conflicting criteria. It becomes difficult to sequence the jobs as the job number increases due to numerous computations involved. In this article, six jobs are considered to be treated on a machine one by one. Seven different priority sequencing rules provide seven different sequencing options for the jobs which are assessed using a set of nine criteria. Preference selection index (PSI) approach, a multi-criterion decision-making (MCDM) technique is proposed to rank them from best to worst. The PSI approach, unlike other MCDM methods, does not require to find the relative significance of the criteria, which reduces work of finding weights of criteria hence is a very easy and effective tool for decision making. A benchmark problem from the previous literature is considered and solved using the PSI approach and the obtained results are found to be correct.

show abstract

Section: Scheduling Problemsmentioning

confidence: 99%

Ranking of sequencing rules in a job shop scheduling problem with preference selection index approach

Bari¹,

Karande²

2022

J. Decis. Anal. Int. Comp.

View full text Add to dashboard Cite

show abstract

“…In the context of scheduling, significant efforts are being made by researchers and consequentially numerous algorithms are developed to address various scheduling problems and their extensions. The various scenarios in which scheduling was considered ranged from a single machine to multi machines, parallel machines to alternative machines and unrelated machines and so on [3,16,21]. Specific to multi machine, [17] considered six machines and proposed heuristics for scheduling.…”

Section: Introductionmentioning

confidence: 99%

Optimization of Multi-item Operation Sequences and Batch Size for Non-Parallel Capacitated Machines: A Case Study

Purohit¹

2017

IJPE

View full text Add to dashboard Cite

Current work presents a case study that simultaneously addresses the classical problem of job sequencing and batch sizing in a manufacturing firm. The firm produces engines and transmission sets for automotive industries and is characterized by multi-stage processing of several sub-products followed by the final assembly. The firm processes 11 components using 23 machines to cater customer demand of transmission sets under constraints like machine capacity and delivery schedule. To propose an improvised schedule and batch sizes, a planning model is developed which also aims to improvise specific performance measurement criteria i.e. makespan. The problem is complex due to exceedingly large solution space, which precludes the use of any exact algorithm. A simulation based Genetic Algorithm (GA) approach is thus used to solve this optimization problem. Authors report successful implementation of the approach and demonstrate improvised results over the existing approach of the firm. The work assists operations manager for efficient planning, and constitutes a practical application of simulation-based optimization involving effective monitoring and control of production.

show abstract

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

et al. 2023

View full text Add to dashboard Cite

Single-machine slack due-window assignment and scheduling with past-sequence-dependent delivery times and controllable job processing times

Cited by 10 publications

References 0 publications

Ranking of sequencing rules in a job shop scheduling problem with preference selection index approach

Ranking of sequencing rules in a job shop scheduling problem with preference selection index approach

Optimization of Multi-item Operation Sequences and Batch Size for Non-Parallel Capacitated Machines: A Case Study

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

Contact Info

Product

Resources

About