Single-machine scheduling problems with both deteriorating jobs and learning effects
Keywords: زمان کل یا زمان صرف شده; Scheduling; Single machine; Makespan; Mean finish time
مقالات ISI زمان کل یا زمان صرف شده (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain
Keywords: زمان کل یا زمان صرف شده; Scheduling; Supply; Transportation; Genetic algorithm; Makespan
A single-machine learning effect scheduling problem with release times
Keywords: زمان کل یا زمان صرف شده; Single machine; Learning effect; Makespan; Release time
An artificial immune algorithm for the flexible job-shop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flexible job-shop; Makespan; Artificial immune algorithm
Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
Keywords: زمان کل یا زمان صرف شده; Batch scheduling; Makespan; Computational complexity; FPTAS
Flexible job-shop scheduling with parallel variable neighborhood search algorithm
Keywords: زمان کل یا زمان صرف شده; Flexible job-shop scheduling; Parallel variable neighborhood search; Combinatorial optimization; Makespan
A two-machine flowshop scheduling problem with deteriorating jobs and blocking
Keywords: زمان کل یا زمان صرف شده; Scheduling; Blocking; Flowshop; Makespan; Deteriorating jobs;
Scheduling on same-speed processors with at most one downtime on each machine
Keywords: زمان کل یا زمان صرف شده; Multiprocessor scheduling; LPT; Downtimes; Fixed jobs; Worst-case bounds; Makespan; Machine shutdowns; Availability constraints
Optimal methods for batch processing problem with makespan and maximum lateness objectives
Keywords: زمان کل یا زمان صرف شده; Batch processing machine; Bi-criteria scheduling; Multi-agent model; Makespan; Maximum lateness; Dynamic programming
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
Keywords: زمان کل یا زمان صرف شده; Scheduling; Batch processing machine; Makespan; Column generation; Branch and price
Group shops scheduling with makespan criterion subject to random release dates and processing times
Keywords: زمان کل یا زمان صرف شده; Group shop scheduling problem; Random release dates; Random processing times; Makespan; Ant colony algorithm; Simulation
A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Flow shop scheduling problem; Particle swarm optimization; Crossover operator; Makespan
An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes
Keywords: زمان کل یا زمان صرف شده; Scheduling; Batch processing machine; Multi-objective optimization; Genetic algorithm; Makespan; Maximum tardiness
Series production in a basic re-entrant shop to minimize makespan or total flow time
Keywords: زمان کل یا زمان صرف شده; Re-entrant shop; Makespan; Total flow time; Series production; Scheduling
A genetic based disk scheduling method to decrease makespan and missed tasks
Keywords: زمان کل یا زمان صرف شده; Disk scheduling; Makespan; Genetic algorithm; Missed tasks
Iterated greedy local search methods for unrelated parallel machine scheduling
Keywords: زمان کل یا زمان صرف شده; Unrelated parallel machines; Makespan; Iterated greedy; Local search
A single-machine scheduling problem with learning effects in intermittent batch production
Keywords: زمان کل یا زمان صرف شده; Single-machine; Scheduling; Intermittent; Learning; Makespan
A note on single-machine group scheduling problems with position-based learning effect
Keywords: زمان کل یا زمان صرف شده; Scheduling; Learning effect; Makespan; Total completion time; Group technology
Heuristic algorithms for two-machine flowshop with availability constraints
Keywords: زمان کل یا زمان صرف شده; Scheduling; Two-machine flowshop; Machine availability; Makespan
Johnson’s rule, composite jobs and the relocation problem
Keywords: زمان کل یا زمان صرف شده; Flowshop; Makespan; Johnson’s rule; Composite job; Relocation problem
Differential evolution for solving multi-mode resource-constrained project scheduling problems
Keywords: زمان کل یا زمان صرف شده; Differential evolution; Scheduling; MRCPSP; Makespan
Preemptive scheduling in the presence of transportation times
Keywords: زمان کل یا زمان صرف شده; Identical parallel machines; Makespan; Preemption; Transportation time; Migration delay; Heuristics; Complexity;
Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
Keywords: زمان کل یا زمان صرف شده; Assembly flowshop; Bicriteria; Makespan; Maximum lateness; Heuristic
A discrete particle swarm optimization algorithm for scheduling parallel machines
Keywords: زمان کل یا زمان صرف شده; Scheduling; Parallel machines; Particle swarm optimization; Makespan
An empirical analysis of the optimality rate of flow shop heuristics
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flow shop; Makespan; Heuristics; Optimality
A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Genetic algorithm; Local search; Hybrid genetic algorithm; Flowshop scheduling; Total flowtime; Makespan
Single machine scheduling with decreasing linear deterioration under precedence constraints
Keywords: زمان کل یا زمان صرف شده; Scheduling; Single machine; Deteriorating jobs; Parallel chains; Series–parallel graph; Makespan
A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
Keywords: زمان کل یا زمان صرف شده; Bottleneck-based multiple insertion heuristic; Flexible flow line; Bottleneck, Unrelated parallel machines; Makespan
Scheduling identical parallel machines and operators within a period based changing mode
Keywords: زمان کل یا زمان صرف شده; Scheduling; Parallel machines; Makespan; Operator; Period based changing mode
The anatomy study of high performance task scheduling algorithm for Grid computing system
Keywords: زمان کل یا زمان صرف شده; Static heuristic; Scheduler; Grid computing; Makespan; Total weighted tardiness
Scheduling parallel machines with resource-dependent processing times
Keywords: زمان کل یا زمان صرف شده; Parallel machines; Resource-dependent processing times; Heuristics; Makespan;
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flowshop; Makespan; Machine availability
Cooperative metaheuristics for the permutation flowshop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Cooperative metaheuristics; Scheduling; Permutation flowshop; Total tardiness; Makespan
A minimized makespan scheduler with multiple factors for Grid computing systems
Keywords: زمان کل یا زمان صرف شده; Scheduling; Dynamic heuristic; Makespan; Total weighted tardiness
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
Keywords: زمان کل یا زمان صرف شده; Complexity; Divide-and-conquer graph; HLF; Identical parallel processors; Makespan
New high performing heuristics for minimizing makespan in permutation flowshops
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flowshop; Makespan; Heuristics
Schedule execution for two-machine flow-shop with interval processing times
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flow-shop; Makespan; Uncertainty; Dominant schedule
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flowshop; Makespan; Heuristics
Single-machine group-scheduling problems with deteriorating setup times and job-processing times
Keywords: زمان کل یا زمان صرف شده; Group technology; Single machine; Deteriorating jobs; Makespan; Sum of completion times;
Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
Keywords: زمان کل یا زمان صرف شده; Scheduling; Parallel machine; Makespan; Almost periodic maintenance; Bin-packing problem
Hybrid tabu search for re-entrant permutation flow-shop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Scheduling; Re-entrant permutation flow-shop; Hybrid tabu search; Makespan
An improved NEH-based heuristic for the permutation flowshop problem
Keywords: زمان کل یا زمان صرف شده; Heuristic; Flowshop; Scheduling; Makespan
Single-machine scheduling problems with a learning effect
Keywords: زمان کل یا زمان صرف شده; Scheduling; Single-machine; Learning effect; Makespan; Total completion time
A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
Keywords: زمان کل یا زمان صرف شده; Scheduling; Re-entrant flow-shop; Genetic algorithm; Makespan
An improved NEH heuristic to minimize makespan in permutation flow shops
Keywords: زمان کل یا زمان صرف شده; Scheduling; Flow shop; Makespan; Heuristics
Single-machine group scheduling problems with deterioration consideration
Keywords: زمان کل یا زمان صرف شده; Group technology; Single machine; Deteriorating jobs; Makespan; Total completion time
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
Keywords: زمان کل یا زمان صرف شده; Simple linear deterioration; Makespan; 0–1 integer programming; Bin packing
Evaluating the performance for makespan minimisation in no-wait flowshop sequencing
Keywords: زمان کل یا زمان صرف شده; Heuristic algorithm; No-wait; Makespan; Flowshop
A note on two-stage hybrid flowshop scheduling with missing operations
Keywords: زمان کل یا زمان صرف شده; Scheduling; Hybrid flowshop; Missing operations; Makespan
Single-machine scheduling with deteriorating jobs under a series–parallel graph constraint
Keywords: زمان کل یا زمان صرف شده; Scheduling; Single machine; Deteriorating jobs; Series–parallel graph; Makespan; Total weighted completion time