Flowshop and Jobshop Schedules: Complexity and Approximation

Cited in

(only showing first 100 items - show all)

Worst-case analysis of an approximation algorithm for flow-shop scheduling
Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
Surrogate duality relaxation for job shop scheduling
On the complexity of generalized due date scheduling problems
The job shop scheduling problem: Conventional and new solution techniques
An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling
A fast tabu search algorithm for the permutation flow-shop problem
A new constructive heuristic for the flowshop scheduling problem
Some results of the worst-case analysis for flow shop scheduling
Reduction of job-shop problems to flow-shop problems with precedence constraints
Performance of scheduling algorithms for no-wait flowshops with parallel machines
A note on worst-case analysis of approximation algorithms for a scheduling problem
Two-machine ordered flowshop scheduling under random breakdowns
Job-shop scheduling with convex models of operations
Minimizing makespan in hybrid flowshops
Makespan minimization in preemptive two machine job shops
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
Flow shop and open shop scheduling with a critical machine and two operations per job
Approximation algorithms for shop scheduling problems with minsum objective
The complexity of cyclic shop scheduling problems
A tabu search approach to machine scheduling
A local search algorithm for the flow shop scheduling problem with release dates
Two-machine flowshop scheduling with job class setups to minimize total flowtime
Approximation results for the two-machine job shop under limited machine availability
Polynomial time approximation algorithms for machine scheduling: Ten open problems
Stochastically minimizing total flowtime in flowshops with no waiting space
Deterministic job-shop scheduling: Past, present and future
The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
Shop scheduling problems with multiprocessor tasks on dedicated processors
An efficient algorithm for a job shop problem
Asymptotic optimality of statistical multiplexing in pipelined processing
Local search methods for the flowshop scheduling problem with flowtime minimization
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
Complexity of mixed shop scheduling problems: A survey
Online scheduling of ordered flow shops
Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Flow shop scheduling with heterogeneous workers
A combination of flow shop scheduling and the shortest path problem
Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
Polynomial time algorithms for the UET permutation flowshop problem with time delays
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
Some results of the worst-case analysis for flow shop scheduling with a learning effect
A state-of-the-art review on scheduling with learning effects
A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
Analysis of heuristics for the UET two-machine flow shop problem with time delays
Approximation schemes for job shop scheduling problems with controllable processing times
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
Designing PTASs for MIN-SUM scheduling problems
Scheduling in network flow shops
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
Performance guarantees for flowshop heuristics to minimize makespan
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
On-line and semi-online scheduling for flow shop problems on two machines
Some new results in flow shop scheduling
Several flow shop scheduling problems with truncated position-based learning effect
Flowshop scheduling with a general exponential learning effect
Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage
Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
A new three-machine shop scheduling: complexity and approximation algorithm
The optimal number of used machines in a two-stage flexible flowshop scheduling problem
Inhomogeneous deterministic two-stage queueing systems
NP-Complete operations research problems and approximation algorithms
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan
Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
Minimizing total completion time in a two-machine flowshop: Analysis of special cases
Flowshop scheduling problems with a position-dependent exponential learning effect
Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
A worst-case analysis of the three-machine flow shop scheduling
scientific article; zbMATH DE number 1437089 (Why is no real title available?)
Permutation flowshop scheduling with simple linear deterioration
Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem
An FPTAS for the parallel two-stage flowshop problem
Proportionate flow shop: new complexity results and models with due date assignment
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
Scheduling algorithms for flexible flowshops: Worst and average case performance
Bounding the running time of algorithms for scheduling and packing problems
A note on scheduling flowshops with flexible stage ordering
Scheduling batches with simultaneous job processing for two-machine shop problems
Workface planning in synchronous production systems
Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm
Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem
An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
Research on m‐machine flow shop scheduling with truncated learning effects
Algorithms for a two‐machine flowshop problem with jobs of two classes
Efficient algorithms for flexible job shop scheduling with parallel machines
A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
A state-of-the-art survey on multi-scenario scheduling
Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
Scheduling for two stages with a single machine and a job shop
New results in the worst-case analysis for flow-shop scheduling

This page was built for publication: Flowshop and Jobshop Schedules: Complexity and Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4147825)