Suchergebnisse - "Iterated greedy algorithm"

Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint von Li, Qiu-Ying, Pan, Quan-Ke, Sang, Hong-Yan, Jing, Xue-Lei, Framiñán, Jose M., Li, Wei-Min

“… This paper addresses a DPFSP with part of jobs subject to a common deadline (DPFSP-PJCD). The objective is to minimize the total completion time …”
Volltext

An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time von Nagano, Marcelo Seido, de Almeida, Fernando Siqueira, Miyata, Hugo Hissashi

“… This article addresses the m-machine no-wait flowshop scheduling problem with the objective of minimizing makespan subject to an upper bound on total completion time …”
Volltext

An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times von de Almeida, Fernando Siqueira, Nagano, Marcelo Seido

“… The objective is to minimize total tardiness subject to an upper bound on makespan. Although these constraints and performance measures have all been extensively studied independently, they have never been considered together in this problem …”
Volltext

Two-stage iterated greedy algorithm for distributed flexible assembly permutation flowshop scheduling problems with sequence-dependent setup times von Li, Yuan-Zhen, Meng, Lei-Lei, Zhang, Biao

“… In this study, the distributed flexible assembly permutation flowshop scheduling problem (DFAPFSP) with sequence-dependent setup times and makespan criterion …”
Volltext

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows von Rolim, Gustavo Alencar, Nagano, Marcelo Seido, Prata, Bruno de Athayde

“… In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows …”
Volltext

A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time von Nagano, Marcelo Seido, Rossi, Fernando Luis

“… This paper investigates the multi-objective mixed no-idle flowshop scheduling problem. The addressed optimization case is minimizing makespan subject to an upper bound on total completion time …”
Volltext

Modeling and Scheduling a Constrained Flowshop in Distributed Manufacturing Environments von Wang, Bing-Tao, Pan, Quan-Ke, Gao, Liang, Miao, Zhong-Hua, Sang, Hong-Yan

“… of the groups subject to production requirements have a common deadline while the others do not have …”
Volltext

Optimization Algorithms: Theory and Applications

“… The subjects that are addressed in the ten research papers cover a broad spectrum of optimization algorithms, such as unconstrained optimization, non-convex optimization, multi-objective optimization …”
Volltext

Efficient heuristic for solving non-permutation flow-shop scheduling problems with maximal and minimal time lags von Ye, Song, Zhao, Ning, Li, Kaidian, Lei, Chuanjin

“… Flow-shop scheduling problem is an attractive subject in the scheduling field, which has attracted the attention of many researchers in the past five decades …”
Volltext

Cyclic scheduling of perishable products in parallel machine with release dates, due dates and deadlines von Shirvani, Nargess, Ruiz, Rubén, Shadrokh, Shahram

“… A mixed integer programming model is proposed and a heuristic solution beside an iterated greedy algorithm is developed to generate good and feasible solutions for the problem …”
Volltext

Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops von Yüksel, Damla, Kandiller, Levent, Taşgetiren, Mehmet Fatih

“… Combining Deep Reinforcement Learning and meta-heuristic techniques represents a new research direction for enhancing the search capabilities of meta-heuristic …”
Volltext

Intelligent optimization under the makespan constraint: Rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem von Wang, Yuhang, Han, Yuyan, Wang, Yuting, Tasgetiren, M. Fatih, Li, Junqing, Gao, Kaizhou

“… In the flowshop scheduling literature, the insertion-based neighborhood search method is often considered to obtain high-quality solutions. It will lead to …”
Volltext

Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function von Miyata, Hugo Hissashi, Nagano, Marcelo Seido, Gupta, Jatinder N. D.

“… ), discrete artificial bee colony (DABC), variable block insertion heuristic (VBIH) and iterated greedy algorithm (IG …”
Volltext

Dynamic Programming Algorithms for Two-Machine Hybrid Flow-Shop Scheduling With a Given Job Sequence and Deadline von Wei, Qi, Wu, Yong

“… This paper studies a problem of scheduling two-task jobs in a two-machine hybrid flow-shop subject to a given job sequence which is used in production of electronic circuits under shared manufacturing …”
Volltext

Heuristics to optimize total completion time subject to makespan in no-wait flow shops with sequence-dependent setup times von Almeida, Fernando Siqueira de, Nagano, Marcelo Seido

“… We propose four algorithms for the no-wait flow shop scheduling problem. The objective is minimizing total completion time such that makespan is not greater …”
Volltext

Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness von Fernandez-Viagas, Victor, Framinan, Jose M.

“… This paper focuses on the problem of scheduling jobs in a permutation flowshop with the objective of makespan minimisation subject to a maximum allowed tardiness for the jobs, a problem that combines …”
Volltext

A heuristic maintenance scheduling framework for a military aircraft fleet under limited maintenance capacities von Zhang, Qin, Liu, Yu, Xiahou, Tangfan, Huang, Hong-Zhong

“… The maintenance scheduling of such a scenario is, however, inherently subject to the limitation …”
Volltext

Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints von Pinheiro, Júlio C. S. N., Arroyo, José Elias C.

“… In this paper we investigate the problem of scheduling a set of jobs on a single-machine. The jobs are classified in families and setup times are required …”
Volltext