The Complexity of Flowshop and Jobshop Scheduling
From MaRDI portal
Publication:4180114
DOI10.1287/moor.1.2.117zbMath0396.90041OpenAlexW2157846217WikidataQ63353547 ScholiaQ63353547MaRDI QIDQ4180114
Michael R. Garey, Ravi Sethi, David S. Johnson
Publication date: 1976
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1.2.117
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
Related Items
Flow shop non-idle scheduling and resource-constrained scheduling, Optimal due date assignment in multi-machine scheduling environments, Exact train pathing, Reducing patient-flow delays in surgical suites through determining start-times of surgical cases, A scatter search algorithm for the distributed permutation flowshop scheduling problem, New hard benchmark for flowshop scheduling problems minimising makespan, Permutation-induced acyclic networks for the job shop scheduling problem, Refined ranking relations for selection of solutions in multi objective metaheuristics, Job-shop production scheduling with reverse flows, List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility, A real-time order acceptance and scheduling approach for permutation flow shop problems, Carbon-efficient scheduling of flow shops by multi-objective optimization, Optimal restricted due date assignment in scheduling, Minimizing total completion time in a two-machine flow shop with deteriorating jobs, The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation, A multi-agent based cooperative approach to scheduling and routing, Dynamic resource allocation to improve emergency department efficiency in real time, A hybrid evolutionary algorithm to solve the job shop scheduling problem, Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems, An assignment-based lower bound for a class of two-machine flow shop problems, An exact parallel method for a bi-objective permutation flowshop problem, A two-stage hybrid flow shop with dedicated machines at the first stage, An integrated search heuristic for large-scale flexible job shop scheduling problems, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, Path-relinking tabu search for the multi-objective flexible job shop scheduling problem, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, Genetic tabu search for the fuzzy flexible job shop problem, A discrete inter-species cuckoo search for flowshop scheduling problems, An effective architecture for learning and evolving flexible job-shop schedules, A taxonomy of flexible flow line scheduling procedures, A competitive and cooperative approach to propositional satisfiability, A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms, New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, Scheduling the truckload operations in automatic warehouses, Evaluation of mathematical models for flexible job-shop scheduling problems, A bicriteria flowshop scheduling problem with setup times, Parallel partitioning method (PPM): A new exact method to solve bi-objective problems, Flow shop scheduling with peak power consumption constraints, Polynomial-time approximation schemes for scheduling problems with time lags, Two-machine flow shop problems with a single server, A new three-machine shop scheduling: complexity and approximation algorithm, A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size, The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm, A neural network algorithm for servicing jobs with sequential and parallel machines, Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration, Minimizing total completion time in two-stage hybrid flow shop with dedicated machines, Improving the anytime behavior of two-phase local search, Minimizing makespan in an ordered flow shop with machine-dependent processing times, Two-machine flow shop scheduling problem with an outsourcing option, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems, Minimizing total completion time for re-entrant flow shop scheduling problems, An improved NEH-based heuristic for the permutation flowshop problem, A PTAS for a particular case of the two-machine flow shop with limited machine availability, Minimizing customer order lead-time in a two-stage assembly supply chain, An FPTAS for the parallel two-stage flowshop problem, Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling, An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan, Two machine flow shop scheduling problem with weighted WIP costs, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness, An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion, Group-scheduling problems in electronics manufacturing, Flexible job shop scheduling with overlapping in operations, An improved constraint satisfaction adaptive neural network for job-shop scheduling, Flow shops with WIP and value added costs, An improved particle swarm optimization algorithm for flowshop scheduling problem, Setting a common due date in a constrained flowshop: a variable neighbourhood search approach, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, A two-machine flowshop problem with two agents, Generating improved dominance conditions for the flowshop problem, Scheduling algorithms for flexible flowshops: Worst and average case performance, Discrepancy search for the flexible job shop scheduling problem, Flow shops with machine maintenance: ordered and proportionate cases, Synchronous flow shop scheduling with pliable jobs, A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs, Total flow time minimization in a flowshop sequence-dependent group scheduling problem, A genetic algorithm for the proportionate multiprocessor open shop, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, A matheuristic approach for the two-machine total completion time flow shop problem, 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, Combinatorial optimisation algorithms for a CAD workstation, 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, A linear time approximation algorithm for permutation flow shop scheduling, The Pareto frontier of inefficiency in mechanism design, Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling, The distributed permutation flowshop scheduling problem, Scheduling MapReduce jobs on identical and unrelated processors, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, V-shop scheduling, Probabilistic behaviour of optimal bin-packing solutions, Branch and bound algorithm for the flow shop with multiple processors, Problem difficulty for tabu search in job-shop scheduling, Some no-wait shops scheduling problems: Complexity aspect, The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm, Flow shop scheduling with flexible processing times, Openshop and flowshop scheduling to minimize sum of completion times, Constraint guided accelerated search for mixed blocking permutation flowshop scheduling, Flow-shop scheduling for three serial stations with the last two duplicate, Two-machine ordered flowshop scheduling under random breakdowns, A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems, Trade-off balancing in scheduling for flow shop production and perioperative processes, A genetic algorithm for the job shop problem, Complexity analysis of job-shop scheduling with deteriorating jobs, An efficient algorithm for a job shop problem, 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, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints, Asymptotic optimality of statistical multiplexing in pipelined processing, Two-stage flowshop scheduling with a common second-stage machine, On the complexity of two machine job-shop scheduling with regular objective functions, A new integer programming formulation for the permutation flowshop problem, A comparison of local search methods for flow shop scheduling, Minimizing total tardiness in permutation flowshops, Flowshop sequencing with mean flowtime objective, Solving the serial batching problem in job shop manufacturing systems, Solving the flexible job shop scheduling problem with sequence-dependent setup times, 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, Two-machine flow shop total tardiness scheduling problem with deteriorating jobs, An adaptive branching rule for the permutation flow-shop problem, Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., A batch-oblivious approach for complex job-shop scheduling problems, A note on makespan minimization in proportionate flow shops, Flow shop scheduling problem with conflict graphs, Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times., Surrogate duality relaxation for job shop scheduling, Concurrent flowshop scheduling to minimize makespan., 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, A review of open queueing network models of manufacturing systems, An interactive layout heuristic based on hexagonal adjacency graphs, 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, 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, Heuristics for permutation flow shop scheduling with batch setup times, 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, A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, Heuristics for the two-stage job shop scheduling problem with a bottleneck machine, On the complexity of coordinated display of multimedia objects, Approximability of flow shop scheduling, An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, A new constructive heuristic for the flowshop scheduling problem, On three-machine flow shops with random job processing times, Two-machine shop scheduling with zero and unit processing times, Two-machine flowshop scheduling with availability constraints, Non-bottleneck machines in three-machine flow shops, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, Two-machine group scheduling problem with blocking and anticipatory setups, Planning and scheduling packaging lines in food industry, 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, Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, 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, Two-machine flowshop scheduling with a secondary criterion, A genetic algorithm for the flowshop scheduling problem, Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling, Scheduling Bidirectional Traffic on a Path, Unnamed Item, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, A worst-case analysis of the three-machine flow shop scheduling, Experimental comparison of heuristics for flow shop scheduling, An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion, Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach, SEQUENCING CONTROL OF PHYSICO‐CHEMICAL PROCESSES, Inhomogeneous deterministic two-stage queueing systems, On non-permutation solutions to some two machine flow shop scheduling problems, Flowshop sequencing problems with limited buffer storage, A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem, A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect, Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II, Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule, An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems, A flexible job shop cell scheduling with sequence‐dependent family setup times and intercellular transportation times using conic scalarization method, A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem, Expansion-based hill-climbing, A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation, Stochastic local search and parameters recommendation: a case study on flowshop problems, FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC, Flexible job-shop scheduling with transportation resources, An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents, Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem, Efficient algorithms for flexible job shop scheduling with parallel machines, Multi-objective fuzzy flexible job shop scheduling using memetic algorithm, Collaborative optimization of workshop layout and scheduling, Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion, Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem, Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry, Flowshop with additional resources during setups: mathematical models and a GRASP algorithm, A state-of-the-art survey on multi-scenario scheduling, Two-machine job-shop scheduling with one joint job, Proportionate Flow Shop Scheduling with Rejection, Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem, A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting, Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling, A memetic algorithm for restoring feasibility in scheduling with limited makespan, A decentralized production–distribution scheduling problem: Solution and analysis, Designs for Order-of-Addition Screening Experiments, Adaptive multimeme algorithm for flexible job shop scheduling problem, A branch-and-bound approach to the no-idle flowshop scheduling problem, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, Unnamed Item, A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, UET flow shop scheduling with delays, A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan, A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, A new approach to computing optimal schedules for the job-shop scheduling problem, Two-stage hybrid flow shop with recirculation, Maximizing Throughput in Flow Shop Real-Time Scheduling, MODELING AND OPTIMIZATION OF COMPLEX SERVICES IN SERVICE-BASED SYSTEMS, An effective new heuristic algorithm for solving permutation flow shop scheduling problem, A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, An effective hybrid optimization strategy for job-shop scheduling problems, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, A flexible flowshop problem with total flow time minimization, The three-stage assembly flowshop scheduling problem, A new adaptive neural network and heuristics hybrid approach for job-shop scheduling, Makespan minimization for flow-shop problems with transportation times and a single robot, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, An improved genetic algorithm for the flowshop scheduling problem, A note on weighted completion time minimization in a flexible flow shop, Flow shop-sequencing problem with synchronous transfers and makespan minimization, Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements, Local search heuristics for two-stage flow shop problems with secondary criterion, Timed event graph-based cyclic reconfigurable flow shop modelling and optimization, Lot streaming in a multiple product permutation flow shop with intermingling, Bounding the Running Time of Algorithms for Scheduling and Packing Problems, Scheduling a proportionate flow shop of batching machines, Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup, COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM, Sequencing a hybrid two-stage flowshop with dedicated machines, Conceptual framework for lot-sizing and scheduling of flexible flow lines, NP-Complete operations research problems and approximation algorithms, An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop, Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand, Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan, A new continuous model for job-shop scheduling, Unnamed Item, A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM, Emergency scheduling of engineering rescue tasks in disaster relief operations and its application in China, Scheduling multi-purpose batch plants with junction constraints, A priority-based genetic algorithm for a flexible job shop scheduling problem, Optimizing resource speed for two-stage real-time tasks, Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph, A variable neighbourhood search algorithm for the flexible job-shop scheduling problem, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling, A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches, A tabu-search heuristic for the flexible-resource flow shop scheduling problem, Applying tabu search to the job-shop scheduling problem, A hybrid heuristic to solve the parallel machines job-shop scheduling problem, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Scheduling of two-machine flowshop with outsourcing lead-time, A very fast TS/SA algorithm for the job shop scheduling problem, A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features, A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems, OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES, A landscape-based analysis of fixed temperature and simulated annealing, Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem, An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem, Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem, Real-time production scheduling in the Industry-4.0 context: addressing uncertainties in job arrivals and machine breakdowns, Solving permutation flow shop scheduling problem with sequence-independent setup time, A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem, A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times, \(N\)-NEH+ algorithm for solving permutation flow shop problems, Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints, Optimization of the integrated problem of employee timetabling and job shop scheduling, Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, Exact solutions for the two-machine robust flow shop with budgeted uncertainty, Optimal control of hybrid manufacturing systems by log-exponential smoothing aggregation, Mathematical modelling and heuristic approaches to job-shop scheduling problem with conveyor-based continuous flow transporters, A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops, Spatial-domain fitness landscape analysis for combinatorial optimization, Single machine scheduling with delivery dates and cumulative payoffs, A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems, Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments, A MILP model for an extended version of the flexible job shop problem, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, Complexity of mixed shop scheduling problems: A survey, A Lagrangean relaxation approach for the mixed-model flow line sequencing problem, Effective neighbourhood functions for the flexible job shop problem, The bike sharing problem, Solving an integrated scheduling and routing problem with inventory, routing and penalty costs, Some effective heuristics for no-wait flowshops with setup times to minimize total completion time, Some new results in flow shop scheduling, A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time, An improved NEH heuristic to minimize makespan in permutation flow shops, Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments, A genetic algorithm for the flexible job-shop scheduling problem, Flowshop scheduling problem with parallel semi-lines and final synchronization operation, Scheduling blocking flowshops with setup times via constraint guided and accelerated local search, A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion, Approximation schemes for job shop scheduling problems with controllable processing times, An algorithm for the solution of the two-route Johnson problem, A new lower bounding rule for permutation flow shop scheduling, A modification to the CGPS algorithm for three-machine flow shop scheduling, Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems, A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time, Scheduling manufacturing systems with blocking: a Petri net approach, Permutation flow shop scheduling with earliness and tardiness penalties, Scheduling job shop associated with multiple routings with genetic and ant colony heuristics, A meta-heuristic to solve the just-in-time job-shop scheduling problem, A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems, Metaheuristics for the online printing shop scheduling problem, Flow shops with reentry: reversibility properties and makespan optimal schedules, Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm, Flowshop/no-idle scheduling to minimise the mean flowtime, TWO-STAGE FLOWSHOP SCHEDULING PROBLEMS WITH IDENTICAL AND BATCH PROCESSORS, Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems, Shop scheduling problems with pliable jobs, A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system, The evolution of schematic representations of flow shop scheduling problems, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Heuristic for stochastic online flowshop problem with preemption penalties, Analysis of models for the stochastic outpatient procedure scheduling problem, Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, Three stage generalized flowshop: Scheduling civil engineering projects, No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths, A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops, Multicriteria scheduling, A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, A review of TSP based approaches for flowshop scheduling, Performance guarantees for flowshop heuristics to minimize makespan, The nonpermutation flowshop scheduling problem: adjustment and bounding procedures, Fair optimization and networks: a survey, A scheduling problem in the baking industry, Solving the selective multi-category parallel-servicing problem, DVS scheduling in a line or a star network of processors, A combination of flow shop scheduling and the shortest path problem, Scheduling with generalized and periodic due dates under single- and two-machine environments
