Keywords: زمان اتمام کامل; Parallel machine scheduling; Total completion time; Sequence-dependent setups; Learning effect; Tiredness effect; Simulation;
مقالات ISI زمان اتمام کامل (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: زمان اتمام کامل; Parallel-machine scheduling; Variable processing times; Learning effect; Maximum completion time; Total completion time;
Keywords: زمان اتمام کامل; Parallel machines; Shop scheduling; Makespan; Total completion time; Total tardiness; Throughput; Number of tardy jobs;
Keywords: زمان اتمام کامل; Order scheduling; Iterated greedy algorithm; Particle swarm optimization algorithm; Total completion time; Maximum tardiness;
Keywords: زمان اتمام کامل; Two-stage three-machine assembly; Flow shop scheduling; Hybrid particle swam optimization; Total completion time; A cumulated learning function;
Keywords: زمان اتمام کامل; Total completion time; Strip packing; Resource allocation; Linear processing rate function;
Keywords: زمان اتمام کامل; Scheduling; Single-machine; Group technology; Makespan; Total completion time; Learning effect; Aging effect;
Keywords: زمان اتمام کامل; Scheduling; Assembly system; Branch-and-bound; Total completion time;
Keywords: زمان اتمام کامل; Scheduling; Distributed; Flowshop; Heuristics; PFSP; Total completion time; Flowtime; Evolutionary; Permutation; NEH; Genetic algorithm;
Keywords: زمان اتمام کامل; Lot scheduling; Single machine; Total completion time; Indivisible order; Integer programming;
Keywords: زمان اتمام کامل; Online scheduling; Hierarchy; Total completion time; Competitive ratio;
An effective and efficient heuristic for no-wait flow shop production to minimize total completion time
Keywords: زمان اتمام کامل; Computational complexity; Heuristics; No-wait flow shop; Total completion time;
Keywords: زمان اتمام کامل; Green manufacturing; Scheduling; Identical and parallel machines; Makespan; Total completion time; Heuristics
Keywords: زمان اتمام کامل; Scheduling; Deteriorating jobs; Learning effect; Makespan; Total completion time; Single-machine;
Keywords: زمان اتمام کامل; Scheduling; Total completion time; Two agent; Two-machine flowshop; Learning effects
Keywords: زمان اتمام کامل; Scheduling; Serial batch; Parallel machine; Total completion time; Rejection; Polynomial time algorithm
Keywords: زمان اتمام کامل; Scheduling; Lot scheduling; Order; Total completion time; Single machine
Keywords: زمان اتمام کامل; Uniform machines; Intelligent scheduling; Total completion time; Release dates; NP-hard; Heuristics;
Keywords: زمان اتمام کامل; Batch scheduling; Bicriteria scheduling; Rejection; Total completion time
Keywords: زمان اتمام کامل; Sustainable manufacturing; Production planning; Energy consumption; Total completion time; Non-dominated sorting genetic algorithm II
Keywords: زمان اتمام کامل; Scheduling; Distributed two-stage assembly flowshop; Hybrid meta-heuristics; Total completion time
Keywords: زمان اتمام کامل; Bi-criteria scheduling; Maximum machine cost; Total machine cost; Makespan; Total completion time; Heuristics;
Keywords: زمان اتمام کامل; Learning effect; Deteriorating jobs; Time-dependent; Makespan; Total completion time; Weighted completion time;
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
Keywords: زمان اتمام کامل; Scheduling; Flowshop; Heuristics; Flowtime; PFSP; Beam search; Total completion time;
Machine scheduling with DeJong’s learning effect
Keywords: زمان اتمام کامل; DeJong’s learning effect; Makespan; Total completion time; FPTAS
Two-agent single-machine scheduling to minimize the weighted sum of the agents’ objective functions
Keywords: زمان اتمام کامل; Scheduling; Total completion time; Total tardiness; Two agents; Single machine
Total completion time with makespan constraint in no-wait flowshops with setup times
Keywords: زمان اتمام کامل; Scheduling; No-wait flowshop; Setup times; Total completion time; Makespan
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Keywords: زمان اتمام کامل; Scheduling; Worst-case ratio; Parallel machines; Total completion time; Availability constraints;
An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time
Keywords: زمان اتمام کامل; Scheduling; Assembly flowshop; Total completion time; Artificial immune system; Heuristic
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
Keywords: زمان اتمام کامل; Scheduling; Online algorithms; Total completion time; Rejection
Unrelated parallel-machine scheduling problems with multiple rate-modifying activities
Keywords: زمان اتمام کامل; Scheduling; Unrelated parallel-machine; Multiple rate-modifying activities; Total completion time; Total machine load
Optimizing blocking flow shop scheduling problem with total completion time criterion
Keywords: زمان اتمام کامل; Scheduling; Blocking flow shop; Total completion time; Mixed binary integer programming model; Branch and bound
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies
Keywords: زمان اتمام کامل; Scheduling; Two-machine flowshop; Sequence-independent setup times; Total completion time; Lower bounds; Lagrangian relaxation
Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
Keywords: زمان اتمام کامل; Scheduling; Single machine; Flowshop; Learning effect; Makespan; Total completion time
A single-machine bi-criterion scheduling problem with two agents
Keywords: زمان اتمام کامل; Scheduling; Total completion time; Maximum tardiness; Two-agent; Single-machine;
Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
Keywords: زمان اتمام کامل; Scheduling; Unrelated parallel machines; Deterioration effect; Deteriorating multi-maintenance activities; Total completion time
A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
Keywords: زمان اتمام کامل; Combinatorial optimization; Parallel scheduling; Total completion time; Malleable jobs
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
Keywords: زمان اتمام کامل; Multipurpose machine scheduling; Online scheduling; Total completion time; Competitive ratio
Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times
Keywords: زمان اتمام کامل; Single machine scheduling; Heuristics; Makespan; Total completion time; Number of tardy jobs; Unavailability period
Bi-criteria scheduling with machine assignment costs
Keywords: زمان اتمام کامل; Multi-objective scheduling; Parallel machines; Machine cost; Makespan; Total completion time; Preemptive and nonpreemptive schedules;
Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
Keywords: زمان اتمام کامل; Two-machine flow shop; Total completion time; Fixed sequence; Dynamic programming
Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects
Keywords: زمان اتمام کامل; Scheduling; Learning effect; Flowshop; Total completion time; Makespan
Unrelated parallel-machine scheduling with deteriorating maintenance activities
Keywords: زمان اتمام کامل; Scheduling; Deteriorating maintenance activity; Assignment problem; Total completion time; Total machine load
Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
Keywords: زمان اتمام کامل; Past-sequence-dependent; Learning effect; Unrelated parallel machine; Scheduling; Total completion time
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
Keywords: زمان اتمام کامل; Scheduling; Rate-modifying activity; Unrelated parallel machines; Total completion time
Single-machine total completion time scheduling with a time-dependent deterioration
Keywords: زمان اتمام کامل; Scheduling; Single-machine; Time-dependent; Deteriorating jobs; Total completion time
Scheduling a batching machine with convex resource consumption functions
Keywords: زمان اتمام کامل; Algorithms; Batching machine; Makespan; Total completion time; Resource consumption function; Workload; Ideal schedules
A two-machine flowshop problem with two agents
Keywords: زمان اتمام کامل; Scheduling; Two-machine flowshop; Two-agent; Total completion time
Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
Keywords: زمان اتمام کامل; Group technology; Group availability; Learning effect; Makespan; Total completion time
Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
Keywords: زمان اتمام کامل; Scheduling; Group technology; Learning effect; Deterioration effect; Makespan; Total completion time