• Nenhum resultado encontrado

[PDF] Top 20 ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness

Has 10000 "ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness" found on our website. Below are the top 20 most common "ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness".

ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness

ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness

... a single-machine scheduling problem with sequence-dependent family setup ...this problem the jobs are classified into families according ... See full document

16

A MAX-MIN ANT SYSTEM TO MINIMIZE TOTAL TARDINESS ON A SINGLE MACHINE WITH SEQUENCE DEPENDENT SETUP TIMES IMPLEMENTING A LIMITED BUDGET LOCAL SEARCH

A MAX-MIN ANT SYSTEM TO MINIMIZE TOTAL TARDINESS ON A SINGLE MACHINE WITH SEQUENCE DEPENDENT SETUP TIMES IMPLEMENTING A LIMITED BUDGET LOCAL SEARCH

... of the SMTTSDST problem suggesting that it is improbable for a single algorithm to always find an optimal solution in practical computational ...On the other hand, the ... See full document

11

A SearchCol Algorithm for the unrelated parallel machine scheduling problem with job splitting

A SearchCol Algorithm for the unrelated parallel machine scheduling problem with job splitting

... studied the UPMSP, with job splitting and distinct release dates for jobs and machines, to minimize total weighted ...tardiness. The authors present a MIP model using ... See full document

163

Two Metaheuristics for the Single-Machine Quadratic Tardiness Scheduling Problem

Two Metaheuristics for the Single-Machine Quadratic Tardiness Scheduling Problem

... squared tardiness and weighted squared tardiness minimization problems, there has been, as of yet, very little research ...Due to its complexity, all of the approaches to squared ... See full document

42

4 A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date

4 A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date

... proposed to find the near optimal solutions for the problem of scheduling jobs on a single ma- chine with a common due date [6, 7, 9] and ...approaches to obtain ... See full document

14

A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES

A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES

... Abstract: The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective and additionally from multi-objective points of ...view. ... See full document

11

Heuristics for the single machine weighted quadratic tardiness scheduling problem with unequal release date

Heuristics for the single machine weighted quadratic tardiness scheduling problem with unequal release date

... before to the best of our knowledge there is only one work that considers the same objective function (Sun et ...paper the jobs have the constraint of sequence dependent ... See full document

49

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints

... years to solve the scheduling problems to minimize total tardiness without setup time and weight ...hybrids, the first one, heuristic or metaheuristics, ... See full document

8

Scheduling Problem with Human Energy Recovery Function under Nonlinear Time-dependent Deterioration

Scheduling Problem with Human Energy Recovery Function under Nonlinear Time-dependent Deterioration

... under the proposed model. Wu and Cheng[11] address that the actual processing time of a job is a decreasing function of the sum of processing times based learning or increasing function of ... See full document

7

Unrelated parallel machine scheduling problem: a cement industry case study

Unrelated parallel machine scheduling problem: a cement industry case study

... up to be extremely fast, even for large instances, and provided good ...parallel machine environments, Na et al. (2006) dealt with a challenge in the wafer fabrication, at a semiconductor ... See full document

126

Optimizing Meta-heuristics for the Time-Dependent TSP Applied to Air Travels

Optimizing Meta-heuristics for the Time-Dependent TSP Applied to Air Travels

... proposed the Traveling Sales- man Challenge (TSC), a problem consisting of finding the best flights to visit a set of cities with the least ...approach to this challenge ... See full document

10

Single-machine Scheduling with Position-based and Sum-of-processing-time-based Learning Effects

Single-machine Scheduling with Position-based and Sum-of-processing-time-based Learning Effects

... situations, the learning effects of machines and humans exist ...considers the position- based learning effect and the sum-of-processing-time-based learning effect at the same ...two ... See full document

6

Optimization of rewards in single machine scheduling in the rewards-driven systems

Optimization of rewards in single machine scheduling in the rewards-driven systems

... technique to solve nonlinear programming (NLP) problems. It is one of the most recently developed and perhaps one of the best methods of ...for the solution of large-scale technologically ... See full document

10

Uma proposta de heurísticas e meta-heurísticas aplicadas ao problema de flow shop scheduling / A proposal of heuristics and metaheuristics for solving the flow shop scheduling problem

Uma proposta de heurísticas e meta-heurísticas aplicadas ao problema de flow shop scheduling / A proposal of heuristics and metaheuristics for solving the flow shop scheduling problem

... Shop Scheduling Problem (PFSP), onde um conjunto de tarefas devem ser sequenciadas numa quantidade de máquinas, objetivando a minimização do Total Completion Time (TCT) do ...ao ILS, gera ... See full document

17

Solving the extended vehicle scheduling problem with metaheuristics

Solving the extended vehicle scheduling problem with metaheuristics

... select the depot/vehicle type of the next vehicle duty to ...so the update on pheromones happens more than once per solution, so the dominant factor is actually the cost of ... See full document

78

A Hybrid Differential Evolution Algorithm for Scheduling Parallel Batch Processing Machine with Unequal Job Ready Times

A Hybrid Differential Evolution Algorithm for Scheduling Parallel Batch Processing Machine with Unequal Job Ready Times

... considered the scheduling batch processing machines in parallel to minimize total ...ready times, arbitrary job sizes, and arbitrary job processing times was ...evaluated ... See full document

6

A Dynamic TDMA-Based Sleep Scheduling to Minimize WSN Energy Consumption

A Dynamic TDMA-Based Sleep Scheduling to Minimize WSN Energy Consumption

... goal: to reduce energy consumption by using a TDMA MAC ...delays the data transport, and increases the node’s energy consumption due to the clock synchronization and to ... See full document

6

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion

Flowshop Scheduling Problem for 10-Jobs, 10-Machines By Heuristics Models Using Makespan Criterion

... is the trend of the development of the Computer Integrated Manufacturing ...of the manufacturing activities (Design, Planning, Scheduling and Control) which produces right product(s) at ... See full document

10

Desenvolvimento de heurísticas para o problema de sequenciamento de tarefas em máquinas paralelas de processamento em lote com entregasDevelopment of heuristics for the job scheduling problem on parallel batching machines with deliveries

Desenvolvimento de heurísticas para o problema de sequenciamento de tarefas em máquinas paralelas de processamento em lote com entregasDevelopment of heuristics for the job scheduling problem on parallel batching machines with deliveries

... Com a globalização e o rápido desenvolvimento tecnológico, o mercado tem se tornado cada vez mais dinâmico e competitivo. Segundo Matias & Nascimento [2013], as constantes mudanças e evoluções do mundo globalizado ... See full document

87

The crew timetabling problem: an extension of the crew scheduling problem

The crew timetabling problem: an extension of the crew scheduling problem

... define the Crew Timetabling Problem (CTP), a problem faced when con- structing duties in transportation ...companies. The traditional Crew Scheduling Problem (CSP) assigns ... See full document

22

Show all 10000 documents...

temas relacionados