The Complexity of Flowshop and Jobshop Scheduling
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A genetic algorithm for the proportionate multiprocessor open shop
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
- The two-stage assembly scheduling problem to minimize total completion time with setup times
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- A genetic algorithm for flowshop scheduling with multiple objectives
- The flow shop problem with no-idle constraints: a review and approximation
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- An empirical analysis of the optimality rate of flow shop heuristics
- Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
- The distributed permutation flowshop scheduling problem
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Some no-wait shops scheduling problems: Complexity aspect
- Openshop and flowshop scheduling to minimize sum of completion times
- A new integer programming formulation for the permutation flowshop problem
- Minimizing total tardiness in permutation flowshops
- Flowshop sequencing with mean flowtime objective
- An adaptive branching rule for the permutation flow-shop problem
- Surrogate duality relaxation for job shop scheduling
- A review of open queueing network models of manufacturing systems
- An interactive layout heuristic based on hexagonal adjacency graphs
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- The job shop scheduling problem: Conventional and new solution techniques
- An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- Approximability of flow shop scheduling
- A new constructive heuristic for the flowshop scheduling problem
- Two-machine shop scheduling with zero and unit processing times
- Two-machine flowshop scheduling with availability constraints
- Two-machine group scheduling problem with blocking and anticipatory setups
- Planning and scheduling packaging lines in food industry
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- Two-machine ordered flowshop scheduling under random breakdowns
- A genetic algorithm for the job shop problem
- Complexity analysis of job-shop scheduling with deteriorating jobs
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Two-stage flowshop scheduling with a common second-stage machine
- On the complexity of two machine job-shop scheduling with regular objective functions
- Job-shop scheduling: Computational study of local search and large-step optimization methods
- Heuristics for scheduling in flowshop with multiple objectives
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- A hierarchical approach for the FMS scheduling problem
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- Concurrent flowshop scheduling to minimize makespan.
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- On the complexity of coordinated display of multimedia objects
- On three-machine flow shops with random job processing times
- Non-bottleneck machines in three-machine flow shops
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Constructing a fuzzy flow-shop sequencing model based on statistical data
- Nonpreemptive flowshop scheduling with machine dominance
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage
- The complexity of cyclic shop scheduling problems
- The convergence of stochastic algorithms solving flow shop scheduling
- A tabu search approach to machine scheduling
- Flow shop scheduling with flexible processing times
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Trade-off balancing in scheduling for flow shop production and perioperative processes
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
- A comprehensive review of flowshop group scheduling literature
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A batch-oblivious approach for complex job-shop scheduling problems
- Flow shop scheduling problem with conflict graphs
- Revisiting simulated annealing: a component-based analysis
- Complexity, bounds and dynamic programming algorithms for single track train scheduling
- An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Two-machine flow-shop scheduling with rejection
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Complexity results for flow-shop problems with a single server
- A comprehensive review and evaluation of permutation flowshop heuristics
- Optimal and heuristic solutions for a scheduling problem arising in a foundry
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A computational study of the permutation flow shop problem based on a tight lower bound
- Parameterized complexity of machine scheduling: 15 open problems
- Approximability of total weighted completion time with resource consuming jobs
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Stochastically minimizing the makespan in two-machine flow shops without blocking
- Deterministic job-shop scheduling: Past, present and future
- A bicriteria approach to the two-machine flow shop scheduling problem
- Heuristics for permutation flow shop scheduling with batch setup times
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
This page was built for publication: The Complexity of Flowshop and Jobshop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180114)
