A survey of scheduling problems with no-wait in process
From MaRDI portal
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Recommendations
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- No-wait scheduling problems with batching machines
- Scheduling and lot streaming in flowshops with no-wait in process
- A concise survey of scheduling with time-dependent processing times
- No-wait shop scheduling: Computational complexity and approximate algorithms
- scientific article; zbMATH DE number 733785
- A new formulation and solution of the flowshop scheduling problem with no in-process waiting
- Approximative procedures for no-wait job shop scheduling.
- Some no-wait shops scheduling problems: Complexity aspect
- Inapproximability results for no-wait job shop scheduling.
Cites work
- scientific article; zbMATH DE number 1279216 (Why is no real title available?)
- scientific article; zbMATH DE number 1910924 (Why is no real title available?)
- scientific article; zbMATH DE number 2230246 (Why is no real title available?)
- A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- A cutting and scheduling problem in float glass manufacturing
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
- A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
- A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
- A heuristic to schedule flexible job-shop in a glass factory
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- A new heuristic and dominance relations for no-wait flowshops with setups
- A note on minimizing maximum lateness in a two-machine no-wait flowshop
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
- A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
- A polynomial algorithm for 2-degree cyclic robot scheduling
- A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
- A review of TSP based approaches for flowshop scheduling
- A rollout metaheuristic for job shop scheduling problems
- A shuffled frog-leaping algorithm for multi-objective no-wait flowshop scheduling
- A survey of scheduling problems with setup times or costs
- A tabu search algorithm for no-wait job shop scheduling problem
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
- An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- An iterative neighborhood search algorithm for large scale no-wait flow-shop
- Approximability of two-machine no-wait flowshop scheduling with availability constraints.
- Approximative procedures for no-wait job shop scheduling.
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
- Discrete Self-Organising Migrating Algorithm for flow-shop scheduling with no-wait makespan
- Feasible insertions in job shop scheduling, short cycles and stable sets
- Fitness landscape analysis for the no-wait flow-shop scheduling problem
- Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Heuristic for no-wait flow shops with makespan minimization
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments
- Heuristics for no-wait flowshops with makespan subject to mean completion time
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Inapproximability results for no-wait job shop scheduling.
- Job-shop scheduling with blocking and no-wait constraints
- Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
- Makespan minimization in a no-wait flow shop problem with two batching machines
- Minimizing Makespan in No-Wait Job Shops
- Minimizing makespan for a no-wait flowshop using genetic algorithm
- Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
- Minimizing total tardiness in no-wait flowshops
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
- Modelling and optimization of industrial manufacturing processes subject to no-wait constraints
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- NP-hardness of compact scheduling in simplified open and flow shops.
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
- New heuristics for no-wait flowshops to minimize makespan.
- No-wait flexible flow shop scheduling with due windows
- No-wait flexible flowshop scheduling with no-idle machines
- No-wait flow shop scheduling using fuzzy multi-objective linear programming
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- No-wait flowshops with bicriteria of makespan and total completion time
- No-wait job shop scheduling: tabu search and complexity of subproblems
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- No-wait shop scheduling: Computational complexity and approximate algorithms
- On Eulerian extensions and their application to no-wait flowshop scheduling
- On no-wait and no-idle flow shops with makespan criterion
- On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
- Optimal job insertion in the no-wait job shop
- Optimal real-time traffic control in metro stations
- Optimal research and numerical simulation for scheduling no-wait flow shop in steel production
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Part sequencing in three-machine no-wait robotic cells
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time
- Predictive-reactive scheduling for single surgical suite subject to random emergency surgery
- Properties of two-machine no-wait flowshop scheduling problems
- Rolling strategy and optimization algorithm for dynamic no-wait flow shop scheduling problem
- Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots
- Scheduling aircraft to reduce controller workload
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Scheduling no-wait robotic cells with two and three machines
- Scheduling patients in an ambulatory surgical center
- Scheduling two-machine no-wait open shops to minimize makespan
- Single-machine scheduling problems with past-sequence-dependent setup times
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
- Some heuristics for no-wait flowshops with total tardiness criterion
- Some local search algorithms for no-wait flow-shop problem with makespan criterion
- The no-wait flow-shop paradox
- The proportionate two-machine no-wait job shop scheduling problem
- The significance of reducing setup times/setup costs
- The third comprehensive survey on scheduling problems with setup times/costs
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
- The two-machine no-wait general and proportionate open shop makespan problem
- Total completion time minimization in a computer system with a server and two parallel processors
- Total completion time with makespan constraint in no-wait flowshops with setup times
- Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated
- Total flowtime in no-wait flowshops with separated setup times.
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- Two-machine flow shop no-wait scheduling with a nonavailability interval
- Two-machine flow shop no-wait scheduling with machine maintenance
- Two-machine flow shop scheduling problems with no-wait jobs
- Two-machine no-wait flow shop scheduling with missing operations
- Two-stage no-wait scheduling models with setup and removal times separated
- \(\frac{3}{2}\)-approximation for two-machine no-wait flowshop scheduling with availability constraints
Cited in
(38)- Air traffic flow management with layered workload constraints
- Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
- Scheduling wine bottling operations with multiple lines and sequence-dependent set-up times: robust formulation and a decomposition solution approach
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- A matheuristic for the MinMax capacitated open vehicle routing problem
- Resource allocation flowshop scheduling with learning effect and slack due window assignment
- New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
- A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
- Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times
- Analysis of flow shop scheduling anomalies
- No-wait two-stage flowshop problem with multi-task flexibility of the first machine
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs
- Coupled task scheduling with exact delays: literature review and models
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems
- Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times
- A two-machine no-wait flow shop problem with two competing agents
- Shop scheduling in manufacturing environments: a review
- A survey of scheduling problems with setup times or costs
- A better dominance relation and heuristics for two-machine no-wait flowshops with maximum lateness performance measure
- Single-machine online scheduling of jobs with non-delayed processing constraint
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
- A systematic literature review on no-idle flow shop scheduling problem
- Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects
- scientific article; zbMATH DE number 7453131 (Why is no real title available?)
- An efficient bicriteria algorithm for stable robotic flow shop scheduling
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths
- Classifying and modeling setups and cleanings in lot sizing and scheduling
- Significantly improved dominance relation for no-wait flowshop scheduling problems with uncertain setup times
- \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
This page was built for publication: A survey of scheduling problems with no-wait in process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751258)
