Keywords: محدودیت دسترسی; Scheduling problem; Job shop; Availability constraint; Makespan; Mixed integer linear programming; Branch-and-bound;
مقالات ISI محدودیت دسترسی (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: محدودیت دسترسی; Single machine scheduling; Availability constraint; Variable neighborhood search; Knowledge module;
Keywords: محدودیت دسترسی; Job shop scheduling; Availability constraint; Preventive maintenance; Mixed Integer Programming; Branch; bound;
Keywords: محدودیت دسترسی; Approximation; scheduling; FPTAS; heuristic; availability constraint
Keywords: محدودیت دسترسی; Integrated scheduling; Availability constraint; Delivery cost; Algorithm; PTAS
Keywords: محدودیت دسترسی; Flowshop scheduling; Availability constraint; MIP formulation; Branch and bound;
MIP formulation and heuristics for multi-stage capacitated lot-sizing and scheduling problem with availability constraints
Keywords: محدودیت دسترسی; Dynamic lot-sizing and scheduling; Flow shop; Availability constraint; Sequence-dependent setup; Mixed-integer programming; MIP-based heuristic
A maintenance optimization model for mission-oriented systems based on Wiener degradation
Keywords: محدودیت دسترسی; Mission-oriented system; Wiener process; Imperfect maintenance; Availability constraint; Optimization
Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints
Keywords: محدودیت دسترسی; Single machine scheduling; Availability constraint; Learning effect; Genetic algorithm; Simulated annealing
Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCiPm,hj1‖∑wiCi scheduling problem
Keywords: محدودیت دسترسی; Scheduling; Availability constraint; Parallel machines; Total weighted completion time
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
Keywords: محدودیت دسترسی; Scheduling; Availability constraint; Maximum earliness; Tardy jobs; Pareto solution
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
Keywords: محدودیت دسترسی; Scheduling; Availability constraint; 0–1 integer programming; Computational complexity; FPTAS
Parallel machine scheduling with machine availability and eligibility constraints
Keywords: محدودیت دسترسی; Scheduling; Parallel machines; Network flows; Availability constraint; Eligibility constraint
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
Keywords: محدودیت دسترسی; Scheduling; Availability constraint; Branch and bound; Integer programming; Dynamic programming
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
Keywords: محدودیت دسترسی; Flowshop scheduling; Approximation scheme; Availability constraint
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Keywords: محدودیت دسترسی; Scheduling; Machines with identical speed; Lateness; Network flows; Binary search; Availability constraint; Eligibility constraint
Makespan minimization for two parallel machines with an availability constraint
Keywords: محدودیت دسترسی; Scheduling; Parallel machine; Availability constraint; Makespan minimization;