Pages that link to "Item:Q4841579"

The following pages link to Scheduling theory. Multi-stage systems. Transl. from the Russ. and updated by the authors (Q4841579):

Displaying 50 items.

• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
• A neural network algorithm for servicing jobs with sequential and parallel machines (Q893921) (← links)
• Scientific school of Academician V. S. Tanaev: results on the scheduling theory (Q893925) (← links)
• Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
• The museum visitor routing problem (Q969135) (← links)
• Scheduling of a single crane in batch annealing process (Q1017463) (← links)
• The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Two-machine shop scheduling with zero and unit processing times (Q1296097) (← links)
• Deterministic job-shop scheduling problems with capacity focus (Q1308500) (← links)
• Stability of a schedule minimizing mean flow time (Q1362250) (← links)
• Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• Resource-constrained project scheduling: A survey of recent developments. (Q1406618) (← links)
• Algorithms of distributed task allocation for cooperative agents (Q1575532) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
• Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
• An \(M\)-stage system with indeterminate processing time. II: Schedule optimization (Q1778599) (← links)
• A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
• Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
• An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
• Handling flexibility in a ``generalised job shop'' with a fuzzy approach (Q1869716) (← links)
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
• The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems (Q1887767) (← links)
• NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
• Minimizing functions of infeasibilities in a two-machine flow shop (Q1969868) (← links)
• Metric interpolation for the problem of minimizing the maximum lateness for a single machine (Q2069682) (← links)
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time (Q2384652) (← links)
• Measures of problem uncertainty for scheduling with interval processing times (Q2393127) (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
• Analysis of multi-stage open shop processing systems (Q2434986) (← links)
• Flowshop scheduling research after five decades (Q2572844) (← links)
• Analysis of multi-stage open shop processing systems (Q3113713) (← links)
• (Q3994687) (← links)
• Les problèmes d'ordonnancement (Q4201834) (← links)
• Some graph‐theoretical models for scheduling in automated production systems (Q4291473) (← links)
• (Q4323632) (← links)
• (Q4396949) (← links)
• (Q4826104) (← links)
• Handbook on Scheduling (Q5754725) (← links)
• Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)
• Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry (Q5954825) (← links)
• A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring (Q6047981) (← links)
• A historical note on the complexity of scheduling problems (Q6161270) (← links)
• Optimal selection and scheduling of jobs with uncertain durations for two employees (Q6641475) (← links)
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times (Q6669643) (← links)