scientific article; zbMATH DE number 782644
From MaRDI portal
Publication:4841579
Recommendations
Cited in
(58)- Scheduling of a single crane in batch annealing process
- The flow shop problem with no-idle constraints: a review and approximation
- The job shop scheduling problem: Conventional and new solution techniques
- Two-machine shop scheduling with zero and unit processing times
- Deterministic job-shop scheduling problems with capacity focus
- Stability of a schedule minimizing mean flow time
- Optimal makespan scheduling with given bounds of processing times
- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Resource-constrained project scheduling: A survey of recent developments.
- Algorithms of distributed task allocation for cooperative agents
- A hybrid genetic algorithm for the open shop scheduling problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine
- Nonpreemptive flowshop scheduling with machine dominance
- An \(M\)-stage system with indeterminate processing time. II: Schedule optimization
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Some concepts of stability analysis in combinatorial optimization
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Handling flexibility in a ``generalised job shop with a fuzzy approach
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- The simple F2//C with forbidden tasks in first or last position: a problem more complex that it seems
- NP-hardness of shop-scheduling problems with three jobs
- Minimizing functions of infeasibilities in a two-machine flow shop
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- Measures of problem uncertainty for scheduling with interval processing times
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Analysis of multi-stage open shop processing systems
- Flowshop scheduling research after five decades
- Analysis of multi-stage open shop processing systems
- Reachability and deadlocking problems in multi-stage scheduling
- scientific article; zbMATH DE number 3882159 (Why is no real title available?)
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- scientific article; zbMATH DE number 3989090 (Why is no real title available?)
- scientific article; zbMATH DE number 41713 (Why is no real title available?)
- Les problèmes d'ordonnancement
- Some graph‐theoretical models for scheduling in automated production systems
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 1167865 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- Handbook on Scheduling
- Open-shop scheduling for unit jobs under precedence constraints
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
- A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring
- A historical note on the complexity of scheduling problems
- Optimal selection and scheduling of jobs with uncertain durations for two employees
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Theory and methodology of time-dependent scheduling: past, present and future
- Flow shops with reentry: the total weighted completion time objective
- Coloring and recognizing mixed interval graphs
- Minimizing the sojourn time of open shop scheduling problems with unit-time operations
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
- A neural network algorithm for servicing jobs with sequential and parallel machines
- Scientific school of Academician V. S. Tanaev: results on the scheduling theory
- Batching and scheduling in a multi-machine flow shop
- The museum visitor routing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4841579)
