ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Biology
Economy
Technology
Research
Social Sciences
Mathematics
Agronomy and forestry
Pure sciences
Medicine / Sub specialtie
all records (74)

Languages
English
Portuguese
Spanish
German
French
Finnish

Countries
Indonesia
Brazil
USA
Ukraine
Italy
South Africa
Chile
Spain
India
Canada
all records (79)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
21.179  Articles
1 of 2.119 pages  |  10  records  |  more records»
This study addresses a common due-date assignment and scheduling problem on a single machine in which job processing times are not given, but controllable. The problem is to determine the common due-date, the processing times and the sequence of the jobs ... see more

En este trabajo se aplica un algoritmo de optimización de colonia de hormigas con límites de feromona superior e inferior denominado Max–Min Ant System, para resolver problemas de programación de una máquina con tiempos de preparación dependientes de la s... see more

En este trabajo se aplica un algoritmo de optimización de colonia de hormigas con límites de feromona superior e inferior denominado Max–Min Ant System, para resolver problemas de programación de una máquina con tiempos de preparación dependientes de la s... see more

This paper presents the evaluation of two metaheuristics to solve the Unrelated Parallel Machine Scheduling Problem with Sequence Machine Dependent Setup Time. Considering such a problem, there is no relation between the time to process each task and the ... see more

This paper proposes a hybrid heuristic that combines Variable Neighborhood Search (VNS) with Ant Colony Optimization (ACO) to solve the scheduling problem of nonrelated parallel machines with sequence dependent setup times in order to minimize the makespa... see more

ENGLISH ABSTRACT: The set-up time for jobs on some multi-station machines , such as manually configured colour printers, are sequence dependent. Many techniques exist for fmding a sequence in which to process the jobs to reduce tot... see more

ENGLISH ABSTRACT: The set-up time for jobs on some multi-station machines , such as manually configured colour printers, are sequence dependent. Many techniques exist for fmding a sequence in which to process the jobs to reduce tot... see more

A scheduling problem in the colour printing industry is considered in this paper. The problem is to find an optimal assignment of print jobs to each of a set of colour printers, as well as an optimal processing sequence for the set of jobs assigned to eac... see more

We study a single machine scheduling problem with sequence-dependent setup time to minimize total tardiness. The jobs are grouped by family. Processing jobs in the same family does not need set up; otherwise there is a fixed amount of setup time between f... see more

1 of 2.119 pages  |  10  records  |  more records»