Keywords: تاریخ های عرضه; Scheduling; Mixed-criticality; Match-up; Release dates; Deadlines;
مقالات ISI تاریخ های عرضه (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: تاریخ های عرضه; Scheduling; Release dates; Agent scheduling; Deterioration; Parallel-batching;
Keywords: تاریخ های عرضه; Unrelated parallel machines scheduling; Deteriorating jobs; Learning effect; Release dates; P-S-D setup times; Meta-heuristic algorithms
Keywords: تاریخ های عرضه; Vehicle routing; Release dates; Computational complexity
Keywords: تاریخ های عرضه; Scheduling; Single-machine; Batch delivery; Release dates; Due windows; Dominance properties; Imperialist competitive algorithm
Keywords: تاریخ های عرضه; Absolute approximation guarantee; Relative approximation guarantee; Scheduling; Stepwise payoffs; Release dates
Keywords: تاریخ های عرضه; Uniform machines; Intelligent scheduling; Total completion time; Release dates; NP-hard; Heuristics;
Keywords: تاریخ های عرضه; Mixed integer programming; Preprocessing; Valid inequalities; Release dates
Keywords: تاریخ های عرضه; Scheduling; Release dates; Rejection penalty; Algorithms; Worst-case analysis
Keywords: تاریخ های عرضه; Single machine scheduling; Release dates; Sequence-dependent setup times; Beam search; Makespan
Bicriteria scheduling problem for unrelated parallel machines with release dates
Keywords: تاریخ های عرضه; Scheduling; Bicriteria; Unrelated parallel machines; Release dates; Tabu search algorithm
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates
Keywords: تاریخ های عرضه; Scheduling; Single machine; Release dates; Lower bounds; Splitting; Total weighted completion time;
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates
Keywords: تاریخ های عرضه; Single machine; Release dates; Heuristics; Genetic Local Search; Genetic Recovering Beam Search
An investigation on a two-agent single-machine scheduling problem with unequal release dates
Keywords: تاریخ های عرضه; Single-machine; Two-agent; Tardiness; Lateness; Release dates;
Resource constraint scheduling with a fractional shared resource
Keywords: تاریخ های عرضه; Resource constraint scheduling; Single shared resource; Total weighted tardiness; Release dates;
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Keywords: تاریخ های عرضه; Scheduling; Batching; Deterioration; Release dates; Dynamic programming
Exact resolution of the one-machine sequencing problem with no machine idle time
Keywords: تاریخ های عرضه; One-machine sequencing problem; No-idle constraint; Makespan; Release dates; Delivery times
Jackson's semi-preemptive scheduling on a single machine
Keywords: تاریخ های عرضه; Semi-preemptive scheduling; Single machine; Release dates; Delivery times; Makespan; Adjustment procedures; Lower bound; Branch-and-bound
Scheduling jobs with release dates on parallel batch processing machines
Keywords: تاریخ های عرضه; Scheduling; Release dates; Parallel batch processing machines; Computational Complexity; PTAS
Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop
Keywords: تاریخ های عرضه; Flowshop; Constructive heuristics; Flowtime; Release dates; Genetic algorithm;
Search tree based approaches for parallel machine scheduling
Keywords: تاریخ های عرضه; Parallel machine scheduling; Makespan; Release dates; Tails; Search tree
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
Keywords: تاریخ های عرضه; Identical parallel machine; Scheduling; Release dates; Lower bound; Dominance properties; Branch and bound
A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
Keywords: تاریخ های عرضه; Machine scheduling; Single machine; Release dates; Weighted number of late jobs; Branch-and-check
Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
Keywords: تاریخ های عرضه; Rescheduling; Makespan; Single machine; Release dates; Disruption; NP-hard
An exact method for Pm/sds,ri/∑i=1nCi problem
Keywords: تاریخ های عرضه; Identical parallel machine; Scheduling; Setup time; Release dates; Lower bound; Dominance properties; Heuristic
Heuristics for the early/tardy scheduling problem with release dates
Keywords: تاریخ های عرضه; Scheduling; Early/tardy; Release dates; Heuristics;
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
Keywords: تاریخ های عرضه; Scheduling; Identical parallel machines; Release dates; Delivery times; Heuristic
Single machine parallel batch scheduling problem with release dates and three hierarchical criteria to minimize makespan, machine occupation time and stocking cost
Keywords: تاریخ های عرضه; Scheduling; Batching; Release dates; Hierarchical criteria; Dynamic programming;
New exact method to solve the Pm/rj/âCj schedule problem
Keywords: تاریخ های عرضه; Parallel machine scheduling; Total flow time; Sum of completion time; Release dates; Job splitting; Lower bound; Branch and bound;
Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times
Keywords: تاریخ های عرضه; Scheduling; Batch processing; Precedence constraints; Release dates; Identical processing times; Algorithms;
An exact approach to early/tardy scheduling with release dates
Keywords: تاریخ های عرضه; Scheduling; Early/tardy; Release dates; Branch-and-bound
Maximization of solution flexibility for robust shop scheduling
Keywords: تاریخ های عرضه; Shop scheduling; Release dates; Deadlines; Flexibility; Dynamic programming;