Flow shop scheduling problem with position-dependent processing times
From MaRDI portal
Publication:2273687
Recommendations
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Machine scheduling problems with a position-dependent deterioration
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A concise survey of scheduling with time-dependent processing times
- A decomposition algorithm for the single machine total tardiness problem
- A note on scheduling deteriorating jobs
- A note on the complexity of flow-shop scheduling with deteriorating jobs
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- An annotated bibliography of GRASP-Part II: Applications
- Benchmarks for basic scheduling problems
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- Flow shop scheduling jobs with position-dependent processing times
- Human performance modelling as an aid in the process of manufacturing system design: A pilot study
- Machine scheduling problems with a position-dependent deterioration
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Minimizing makespan in three-machine flow shops with deteriorating jobs
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects
- Scheduling algorithms
- Scheduling on parallel processors with varying processing times
- Scheduling. Theory, algorithms, and systems.
- Single machine scheduling with stochastically dependent times
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
- Some heuristics for no-wait flowshops with total tardiness criterion
- Survey, categorization, and comparison of recent tour scheduling literature
- Time-dependent scheduling
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
Cited in
(10)- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
- Minimizing the machine processing time in a flow shop scheduling problem under piecewise quadratic fuzzy numbers
- scientific article; zbMATH DE number 5856053 (Why is no real title available?)
- scientific article; zbMATH DE number 3852771 (Why is no real title available?)
- scientific article; zbMATH DE number 4147845 (Why is no real title available?)
- The flow shop problem with time lags and separated setup times
- scientific article; zbMATH DE number 1839523 (Why is no real title available?)
- A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect
- An enhanced GRASP approach for the index tracking problem
- Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities
This page was built for publication: Flow shop scheduling problem with position-dependent processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273687)
