ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Technology
Research
Biology
Architecture and Urbanism
Social Sciences
Pure sciences
Economy
Computing
Mathematics
all records (75)

Languages
English
Spanish
Portuguese
German

Countries
Indonesia
USA
Brazil
Ukraine
Italy
South Africa
Spain
Switzerland
Romania
Turkey, Turkish Republic
all records (79)

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

Filter  
 
143.176  Articles
1 of 14.319 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

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

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

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

With the growth in customer demand diversification, mixed-model assembly lines have gained increasing importance in the field of management. Sequencing decisions are crucial to managing mixed-model assembly lines. To improve work efficiency of the mixed-m... see more

In this paper we study the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. We consider the objective of minimizing the maximum completion time of the latest job, usually referred to as makespan. We propose a ... 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 study proposes a multi-choice goal programming for the single machine scheduling problem of minimizing the weighted number of tardy jobs, the total weighted completion time and makespan with sequence-dependent setup times. In this problem, there are ... see more

This research is dedicated to the Production Scheduling Problem in a hybrid flow shop with setup times separated from processing times. The goal is to identify and analyze the current literature to identify papers that develop methods to solve this proble... see more

1 of 14.319 pages  |  10  records  |  more records»