Keywords: تعداد مشاغل مضطرب; Parallel machines; Shop scheduling; Makespan; Total completion time; Total tardiness; Throughput; Number of tardy jobs;
مقالات ISI تعداد مشاغل مضطرب (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: تعداد مشاغل مضطرب; Single machine; Scheduling; Dominance relation; Number of tardy jobs; Algorithm;
Stochastic cell loading to minimize nT subject to maximum acceptable probability of tardiness
Keywords: تعداد مشاغل مضطرب; Cell loading; Non-linear modeling; Stochastic scheduling; Number of tardy jobs
A note on a single machine scheduling problem with generalized total tardiness objective function
Keywords: تعداد مشاغل مضطرب; Scheduling; Single machine; Total tardiness; Number of tardy jobs; Total late work; Pseudo-polynomial algorithm; Graphical algorithm
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
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
Keywords: تعداد مشاغل مضطرب; Scheduling; Number of tardy jobs; Deadline; Independent set
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Keywords: تعداد مشاغل مضطرب; Flowshop; Scheduling; Number of tardy jobs; Operation assignment; Simulated annealing
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
Keywords: تعداد مشاغل مضطرب; Bicriteria scheduling; Average flowtime; Number of tardy jobs; Beam search
Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops
Keywords: تعداد مشاغل مضطرب; Scheduling; Two-stage hybrid flow shop; Number of tardy jobs; Branch and bound; Heuristics
Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
Keywords: تعداد مشاغل مضطرب; Scheduling; Single machine; Dual criteria; Earliness; Number of tardy jobs
Single-machine scheduling with general learning functions
Keywords: تعداد مشاغل مضطرب; Scheduling; Single machine; Learning effect; Sum of completion times square; Weighted sum of completion times; Maximum lateness; Number of tardy jobs
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
Keywords: تعداد مشاغل مضطرب; Flowshop; Scheduling; Number of tardy jobs; Secondary resources; Dual resource scheduling; Simulated annealing
Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
Keywords: تعداد مشاغل مضطرب; Genetic algorithm; Bi-criteria scheduling; Number of tardy jobs; Maximum earliness
Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs
Keywords: تعداد مشاغل مضطرب; Scheduling; Parallel machines; Dual resource constrained scheduling; Number of tardy jobs
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Keywords: تعداد مشاغل مضطرب; Scheduling; Number of tardy jobs; Maximum weighted tardiness; NP-hard; Heuristics