Results 81 to 90 of about 6,981,143 (177)

An Improved Marriage in Honey-Bee Optimization Algorithm for Minimizing Earliness/Tardiness Penalties in Single-Machine Scheduling with a Restrictive Common Due Date

Mathematics
This study evaluates the efficiency of a swarm intelligence algorithm called marriage in honey-bee optimization (MBO) in solving the single-machine weighted earliness/tardiness problem, a type of NP-hard combinatorial optimization problem. The goal is to
Pedro Palominos, Mauricio Mazo, Guillermo Fuertes, Miguel Alfaro   +3 more
doaj   +1 more source

A Novel Algorithm to Scheduling Optimization of Melting-Casting Process in Copper Alloy Strip Production

Discrete Dynamics in Nature and Society, 2015
Melting-casting is the first process in copper alloy strip production. The schedule scheme on this process affects the subsequent processes greatly. In this paper, we build the multiobjective model of melting-casting scheduling problem, which considers ...
Xiaohui Yan, Zhicong Zhang, Jianwen Guo, Shuai Li, Kaishun Hu   +4 more
doaj   +1 more source

TOTAL WEIGHTED TARDINESS MINIMIZATION FOR TASKS WITH A COMMON DUE DATE ON PARALLEL MACHINES IN CASE OF AGREEABLE WEIGHTS AND PROCESSING TIMES

Вісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, 2019
We consider  tasks scheduling problem on  identical parallel machines by the criterion of minimizing the total weighted tardiness of tasks. All tasks arrive for processing at the same time.
Alexander Anatolievich Pavlov, Elena Borisovna Misura, Oleg Valentinovich Melnikov   +2 more
doaj   +1 more source

Heuristics for the Early/Tardy Scheduling Problem with Release Dates [PDF]

In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search ...
Rui A. F. S. Alves, Jorge M. S. Valente
core  

A hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks

International Journal of Industrial Engineering and Production Research, 2012
In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also ...
M. Ranjbar
doaj  

Single-Machine Rescheduling with Rejection and an Operator No-Availability Period

Mathematics
In this paper, we investigate a rescheduling problem with rejection and an operator non-availability period on a single machine. An optimal original schedule with the objective of minimizing the total weighted completion time has been made in a ...
Guanghua Wu, Hongli Zhu
doaj   +1 more source

Hybrid Metaheuristics for Solving a Fuzzy Single Batch-Processing Machine Scheduling Problem

The Scientific World Journal, 2014
This paper deals with a problem of minimizing total weighted tardiness of jobs in a real-world single batch-processing machine (SBPM) scheduling in the presence of fuzzy due date.
S. Molla-Alizadeh-Zavardehi, R. Tavakkoli-Moghaddam, F. Hosseinzadeh Lotfi   +2 more
doaj   +1 more source

A Multi-objective Optimization Model for Robust Skip-Stop Scheduling with Earliness and Tardiness Penalties

Urban Rail Transit, 2019
Inefficient transport systems impose extra travel time for travelers, cause dissatisfaction and reduce service levels. In this study, the demand-oriented train scheduling problem is addressed using a robust skip-stop method under uncertain arrival rates ...
Farzaneh Rajabighamchi, Ebrahim Mohammadi Hosein Hajlou, Erfan Hassannayebi   +2 more
doaj   +1 more source

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties [PDF]

In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies
Maria R. A. Moreira, Jorge M. S. Valente
core  

A simple, fast, and effective heuristic for the single-machine total weighted tardiness problem [PDF]

, 2012
We consider the single-machine total weighted tardiness problem (TWT) where a set of n jobs with general weights w_1,…, w_n, integer processing times p_1,…, p_n, and integer due dates d_1,…, d_n has to be scheduled non-preemptively.
Şen, Halil, Bülbül, Kerem
core   +2 more sources