Scheduling jobs with equal processing times and a single server on parallel identical machines

Zhang, An; Wang, Hongjun; Chen, Yong; Chen, Guangting

doi:10.1016/j.dam.2016.05.014

Cited by 8 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The longest processing time (LPT) rule is often used to solve the scheduling problem with minimal makespan [6,[38][39][40][41]. The shortest processing time (SPT) rule is often used to solve the scheduling problem with minimal the total completion time [42][43][44][45].…”

Section: Heuristic Methodsmentioning

confidence: 99%

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Shen¹,

Zhu²

2020

IJCIS

View full text Add to dashboard Cite

A single machine scheduling problem with periodic maintenance is studied in this paper. Due to many uncertainties in reality, the processing time is recognized as an uncertain variable. The aim is to minimize the makespan at a confidence level. An uncertain chance-constrained programming model is developed to delve into the impact of uncertainties on decision variables, and an algorithm for calculating the objective function is proposed. According to the theoretical analysis, a novel method named longest shortest processing time (LSPT) rule is proposed. Subsequently, an improved genetic algorithm (GA-M) combined with LSPT rule is proposed. Numerical experiments are used to verify the feasibility of this model and algorithm.

show abstract

Section: Heuristic Methodsmentioning

confidence: 99%

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Shen¹,

Zhu²

2020

IJCIS

View full text Add to dashboard Cite

show abstract

“…Согласно правилу, все задания упорядочиваются в порядке невозрастания времени их обработки. Правило наименьшего времени обработки с сортировкой по возрастанию применяется для решения задач планирования с минимальным общим временем выполнения [3,4].…”

unclassified

Production Planning Problem with Work Completion Time Uncertainty

Velikiy,

Gorokhov,

Tenenev

2024

Intellekt. Sist. Proizv.

View full text Add to dashboard Cite

Planning is a prerequisite for improving the industrial efficiency of any production. The main tasks in planning are to minimize time and total costs. The efficiency of equipment utilization depends on workflow management of certain types of machine fleet in the production of multi-item products. Skilled planning reduces costs of raw material and componentrelocation and stacking. One of the important issues is the production scheduling for the following process flow. There are several types of equipment or machines. Machines can operate in parallel. There may be several machines of the same type. The equipment is used to process some items or parts of various types. Each part takesspecific time to be processed on a particular machine type. In addition, according to the manufacturing process technology, there is a sequence of operations on a particular machine type for each part. A machine can process only one partat a time. Limited stacking placefor the parts to be processed may become an extra condition. The article sets the schedulingtask for a given number of different contentworks processingon a given sequence of machines of different types. A machine refers to any device used to perform a process operation related to the operation. Each product or work has an individual sequence of technological operations. The possibility of componentparallel processing in batches intended for the assembly of different products is taken into account withtime uncertainty in the task is allowed. To solve the problem of minimizing finite time, a genetic algorithm is used with the representation of the chromosome in the form of a Petri network. The calculations showed that uncertainties lead to an increase in the release time of products.

show abstract

Minimization of maximum lateness on parallel machines with a single server and job release dates

et al. 2023

View full text Add to dashboard Cite

Scheduling jobs with equal processing times and a single server on parallel identical machines

Cited by 8 publications

References 13 publications

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

A Single Machine Scheduling with Periodic Maintenance and Uncertain Processing Time

Production Planning Problem with Work Completion Time Uncertainty

Minimization of maximum lateness on parallel machines with a single server and job release dates

Contact Info

Product

Resources

About