Pages that link to "Item:Q3812024"
From MaRDI portal
The following pages link to Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems (Q3812024):
Displaying 50 items.
- Scheduling with general position-based learning curves (Q424784) (← links)
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
- Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties (Q548379) (← links)
- Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
- Single machine scheduling problems with controllable processing times and total absolute differences penalties (Q856259) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
- Bicriterion scheduling of identical processing time jobs by uniform processors (Q1265856) (← links)
- Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties (Q1278719) (← links)
- Minimizing flow time variance in a single machine system using genetic algorithms (Q1310012) (← links)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- A solvable case of the variance minimization problem (Q1324501) (← links)
- Incorporating preference information into multi-objective scheduling (Q1333459) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process (Q1341405) (← links)
- The determination of the optimal component input numbers for the completion of a single manufacturing order (Q1390265) (← links)
- Assignment of a job load in a distributed system: A multicriteria design method (Q1390284) (← links)
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times (Q1634027) (← links)
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
- Parallel-machine scheduling with non-simultaneous machine available time (Q1667812) (← links)
- Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity (Q1667833) (← links)
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization (Q1680765) (← links)
- Minimizing total completion time and total deviation of job completion times from a restrictive due-date (Q1776951) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← links)
- Simultaneous minimization of total completion time and total deviation of job completion times (Q1877049) (← links)
- Processing-plus-wait due dates in single-machine scheduling (Q1893346) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Combined gradient methods for multiobjective optimization (Q2089219) (← links)
- Resource allocation scheduling with deteriorating jobs and position-dependent workloads (Q2097458) (← links)
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection (Q2098030) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- Scheduling problems with effects of deterioration and truncated job-dependent learning (Q2354204) (← links)
- Inexact projected gradient method for vector optimization (Q2377166) (← links)
- Single-machine scheduling with time-and-resource-dependent processing times (Q2428936) (← links)
- Parallel machines scheduling with deteriorating and learning effects (Q2448133) (← links)
- Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time (Q2448135) (← links)
- Single-machine scheduling problems with past-sequence-dependent setup times (Q2467251) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
