Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
From MaRDI portal
Publication:3812024
DOI10.1287/opre.37.1.118zbMath0661.90046OpenAlexW1994856874MaRDI QIDQ3812024
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.1.118
parametric analysisbicriterion schedulingin-process inventoryjob completionjob waiting timesnonpreemptive single machinevariation of waiting time
Related Items
Simultaneous minimization of total completion time and total deviation of job completion times, Incorporating preference information into multi-objective scheduling, On the equivalence of constrained and unconstrained flows, A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process, Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines, A nonmonotone gradient method for constrained multiobjective optimization problems, Inexact projected gradient method for vector optimization, Processing-plus-wait due dates in single-machine scheduling, A general scheme for solving a large set of scheduling problems with rejection in FPT time, Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times, Multicriteria scheduling using fuzzy theory and tabu search, A note on resource allocation scheduling with position-dependent workloads, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Parallel-machine scheduling with non-simultaneous machine available time, Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, A bi-criterion algorithm for minimizing machine interference and reducing job waiting time, Mimimization of agreeably weighted variance in single machine systems, Total absolute deviation of job completion times on uniform and unrelated machines, Simple matching vs linear assignment in scheduling models with positional effects: a critical review, Strictly feasible solutions and strict complementarity in multiple objective linear optimization, The determination of the optimal component input numbers for the completion of a single manufacturing order, Assignment of a job load in a distributed system: A multicriteria design method, Multitasking scheduling with multiple rate‐modifying activities, Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect, Minimizing the total waiting time of intermediate products in a manufacturing process, Optimization of scheduling problems with deterioration effects and an optional maintenance activity, Resource dependent scheduling with truncated learning effects, Single-machine scheduling with time-and-resource-dependent processing times, Scheduling with general position-based learning curves, A bicriteria approach to scheduling a single machine with job rejection and positional penalties, Parallel machines scheduling with deteriorating and learning effects, Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time, Single-machine scheduling problems with past-sequence-dependent setup times, Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis, SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties, Scheduling problems with a learning effect, A unified approach for scheduling with convex resource consumption functions using positional penalties, A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times, Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences, Hierarchical minimization of completion time variance and makespan in jobshops, Minimizing total completion time and total deviation of job completion times from a restrictive due-date, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, An approximation scheme for the bi-scenario sum of completion times trade-off problem, New results on the completion time variance minimization, A bicriteria approach to the two-machine flow shop scheduling problem, Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization, Bicriterion scheduling of identical processing time jobs by uniform processors, Genetic algorithms for the two-stage bicriteria flowshop problem, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis, Approximation results for a bicriteria job scheduling problem on a single machine without preemption, Combined gradient methods for multiobjective optimization, Resource allocation scheduling with deteriorating jobs and position-dependent workloads, A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, Minimizing flow time variance in a single machine system using genetic algorithms, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Completion time variance minimization on a single machine is difficult, Scheduling problems with effects of deterioration and truncated job-dependent learning, A solvable case of the variance minimization problem
