4.4 Article

Flexible open-shop problem for minimizing weighted total completion time

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Review Management

Four decades of research on the open-shop scheduling problem to minimize the makespan

Mohammad Mahdi Ahmadian et al.

Summary: The open-shop scheduling problem involves scheduling jobs on different machines to optimize performance metrics. Recent research interest has been focused on the computational complexity and solution methodologies for variants of the problem.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Proceedings Paper Engineering, Industrial

A survey of intelligent algorithms for open shop scheduling problem

Zizhao Huang et al.

11TH CIRP CONFERENCE ON INDUSTRIAL PRODUCT-SERVICE SYSTEMS (2019)

Article Computer Science, Artificial Intelligence

Balancing exploration and exploitation in memetic algorithms: A learning automata approach

Mehdi Rezapoor Mirsaleh et al.

COMPUTATIONAL INTELLIGENCE (2018)

Article Computer Science, Interdisciplinary Applications

Flexible open shop scheduling problem to minimize makespan

Danyu Bai et al.

COMPUTERS & OPERATIONS RESEARCH (2016)

Article Computer Science, Artificial Intelligence

Memetic algorithms and memetic computing optimization: A literature review

Ferrante Neri et al.

SWARM AND EVOLUTIONARY COMPUTATION (2012)

Article Mathematics, Applied

Scheduling open shops with parallel machines to minimize total completion time

B. Naderi et al.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2011)

Article Computer Science, Interdisciplinary Applications

A genetic algorithm for the proportionate multiprocessor open shop

Marie E. Matta

COMPUTERS & OPERATIONS RESEARCH (2009)

Article Mathematics, Applied

Linear time approximation scheme for the multiprocessor open shop problem

SV Sevastianov et al.

DISCRETE APPLIED MATHEMATICS (2001)