Optimal two- and three-stage production schedules with setup times included

DOI10.1002/nav.3800010110zbMath1349.90359OpenAlexW2024085737MaRDI QIDQ2834736

No author found.

Publication date: 23 November 2016

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800010110

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Two-stage hybrid flowshop scheduling with simultaneous processing machines, Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, Single machine scheduling with job delivery to multiple customers, Design of components for schedulability, Preemptive scheduling with release dates, delivery times and sequence independent setup times, Scheduling a two-stage hybrid flowshop with separable setup and removal times, Flow shop scheduling with flexible processing times, On some geometric methods in scheduling theory: A survey, An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal, Two-machine ordered flowshop scheduling under random breakdowns, The three-machine flow-shop problem with arbitrary precedence relations, Trade-off balancing in scheduling for flow shop production and perioperative processes, Minimizing makespan in hybrid flowshops, Flowshop scheduling with dominant machines, Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times., Complexity analysis of job-shop scheduling with deteriorating jobs, Online scheduling problems with flexible release dates: applications to infrastructure restoration, A comprehensive review of flowshop group scheduling literature, Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines, Reduction of permutation flowshop problems to single machine problems using machine dominance relations, 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, Energy-efficient bi-objective single-machine scheduling with power-down mechanism, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, A variant of the permutation flow shop model with variable processing times, Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints, Truck synchronization at single door cross-docking terminals, Approximate algorithms for the \(P\parallel C_{\max}\) problem, Polynomial algorithms for single machine scheduling problems with financial constraints, Heuristic algorithms for the two-stage hybrid flowshop problem, Two-stage flowshop scheduling with a common second-stage machine, Two-stage no-wait scheduling models with setup and removal times separated, Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times, A polynomial approximation scheme for problem \(F2/r_ j/C_{\text{max}}\), Applications of max-plus algebra to flow shop scheduling problems, Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks, Heuristics for scheduling in flowshop with multiple objectives, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Heuristic procedures for minimizing makespan and the number of required pallets, Sequencing with restrictions in processing times, Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times., Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times, An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers., A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage., A contribution to the stochastic flow shop scheduling problem., 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., Improved genetic algorithm for the permutation flowshop scheduling problem., Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs., A local search algorithm for the flow shop scheduling problem with release dates, Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect, Two-machine flowshop scheduling in a physical examination center, Exact exponential algorithms for 3-machine flowshop scheduling problems, Heuristics for periodical batch job scheduling in a MapReduce computing framework, A constraint generation approach for two-machine shop problems with jobs selection, On the optimality conditions of the two-machine flow shop problem, Heuristics for a flowshop scheduling problem with stepwise job objective function, A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion, Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems, An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times, Parallel hybrid heuristics for the permutation flow shop problem, Two-machine flow-shop scheduling with rejection, Resource-constrained flowshop scheduling with separate resource recycling operations, A note on a due-date assignment on a two-machine flow-shop, No-wait or no-idle permutation flowshop scheduling with dominating machines, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines, 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, Approximability of flow shop scheduling, Approximation algorithms for two-machine flow shop scheduling with batch setup times, Two-machine flowshop group scheduling problem, Group technology approach to the open shop scheduling problem with batch setup times, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, A new constructive heuristic for the flowshop scheduling problem, Time lag size in multiple operations flow shop scheduling heuristics, Scheduling a flowline manufacturing cell with sequence dependent family setup times, On three-machine flow shops with random job processing times, Minimizing makespan in a pallet-constrained flowshop, Efficiency of reductions of job-shop to flow-shop problems, Minimization of the makespan in a two-machine problem under given resource constraints, A bicriteria two-machine permutation flowshop problem, Two-machine flowshop scheduling with availability constraints, A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan, A tabu search approach for the flow shop scheduling problem, Reduction of job-shop problems to flow-shop problems with precedence constraints, Non-bottleneck machines in three-machine flow shops, Flow shop and open shop scheduling with a critical machine and two operations per job, An improved heuristic for two-machine flowshop scheduling with an availability constraint, Generating the best \(K\) sequences in relocation problems, Two-machine group scheduling problem with blocking and anticipatory setups, An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns, Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure, Nonpreemptive flowshop scheduling with machine dominance, Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage, The complexity of cyclic shop scheduling problems, Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints, An improved two-machine flowshop scheduling with intermediate transportation, Flow shop non-idle scheduling and resource-constrained scheduling, Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm, New results on two-machine flow-shop scheduling with rejection, Relocation scheduling subject to fixed processing sequences, Exact method for the two-machine flow-shop problem with time delays, The bipartite margin shop and maximum red matchings free of blue-red alternating cycles, Makespan distribution of permutation flowshop schedules, A scatter search algorithm for the distributed permutation flowshop scheduling problem, An effective differential evolution algorithm for permutation flow shop scheduling problem, New hard benchmark for flowshop scheduling problems minimising makespan, Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration, Job-shop production scheduling with reverse flows, On heuristic solutions for the stochastic flowshop scheduling problem, A real-time order acceptance and scheduling approach for permutation flow shop problems, Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Two-agent scheduling in a flowshop, Problem \(F2||C_{\max}\) with forbidden jobs in the first or last position is easy, 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, Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns, Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms, An exact parallel method for a bi-objective permutation flowshop problem, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, Flowshop scheduling with a general exponential learning effect, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan, A mixed integer programming approach for the single machine problem with unequal release dates, A bi-objective integrated procurement, production, and distribution problem of a multi-echelon supply chain network design: a new tuned MOEA, On double cycling for container port productivity improvement, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, A note on ``Two-machine flow-shop scheduling with rejection and its link with flow-shop scheduling and common due date assignment, A generalized constructive algorithm using insertion-based heuristics, Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops, Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times, A study on several combination problems of classic shop scheduling and shortest path, Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints, Polynomial-time approximation schemes for scheduling problems with time lags, An improved algorithm for the two machine flow shop problem with several availability constraints, A new three-machine shop scheduling: complexity and approximation algorithm, Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev, 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, Improving the anytime behavior of two-phase local search, Permutation flow shop scheduling with order acceptance and weighted tardiness, Dominance rules in combinatorial optimization problems, Routing open shop and flow shop scheduling problems, Two-machine flow shop scheduling problem with an outsourcing option, Approximation algorithms for the parallel flow shop problem, Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect, Two-machine flowshop scheduling with intermediate transportation under job physical space consideration, Tight complexity analysis of the relocation problem with arbitrary release dates, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, Inverse scheduling: Two-machine flow-shop problem, A unified framework for population-based metaheuristics, A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem, Flowshop scheduling problems with a position-dependent exponential learning effect, Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm, The two-stage assembly flow shop scheduling with an availability constraint: worst case analysis, A PTAS for a particular case of the two-machine flow shop with limited machine availability, Hybrid flowshop scheduling with interstage job transportation, On two-machine flow shop scheduling, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence, Non-permutation flow shop scheduling with order acceptance and weighted tardiness, Batch scheduling in a two-machine flow shop with limited buffer, Flow shop scheduling on 2-machines with setup time and single transport facility under fuzzy environment, An FPTAS for the parallel two-stage flowshop problem, Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited, Optimal switching between cash-flow streams, New results in the worst-case analysis for flow-shop scheduling, On the heuristic solution of the permutation flow shop problem by path algorithms, A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints, Batching decisions for assembly production systems, Two-agent single-machine scheduling problems under increasing linear deterioration, Makespan minimization in machine dominated flowshop, Elimination conditions and lower bounds for the permutation flow-shop sequencing problem, Scheduling algorithms for flexible flowshops: Worst and average case performance, Synchronous flow shop scheduling with pliable jobs, Two-machine flow shop and open shop scheduling problems with a single maintenance window, A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem, A (\(\frac {4}{3}\))-approximation algorithm for a special case of the two machine flow shop problem with several availability constraints, Algorithms for a realistic variant of flowshop scheduling, Towards a heterogeneous and adaptive parallel branch-and-bound algorithm, Isomorphic scheduling problems, The connection between the bump number problem and flow-shop scheduling with precedence constraints, Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects, A linear time approximation algorithm for permutation flow shop scheduling, The Pareto frontier of inefficiency in mechanism design, A robust two-machine flow-shop scheduling model with scenario-dependent processing times, Research on construction and application for the model of multistage job shop scheduling problem, Effective optimization methods for single-machine scheduling (survey), V-shop scheduling, Algorithms for two-machine flow-shop sequencing with precedence constraints, Flowshop/no-idle scheduling to minimize total elapsed time, Filtering policies in loss queueing network location problems, Machine scheduling with job delivery coordination, Scheduling flexible flow lines with sequence-dependent setup times, Comments on Flow shop and open shop scheduling with a critical machine and two operations per job, Two-machine flow shop scheduling with two criteria: maximum earliness and makespan, A PTAS for non-resumable open shop scheduling with an availability constraint, Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph, A neuro-tabu search heuristic for the flow shop scheduling problem, Complexity of flow shop scheduling problems with transportation constraints, Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity, Scheduling shops to minimize the weighted number of late jobs, Scheduling multiple two-stage flowshops with a deadline, A general scheme for solving a large set of scheduling problems with rejection in FPT time, Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem, A survey of job shop scheduling problem: the types and models, A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Exact method to optimize the total electricity cost in two-machine permutation flow shop scheduling problem under time-of-use tariff, Lot streaming in the two-machine flow shop with setup times, Shop scheduling problems with multiprocessor tasks on dedicated processors, An efficient algorithm for a job shop problem, Scheduling a two-machine robotic cell: A solvable case, On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements, Scheduling on multiple two-stage flowshops with a deadline, Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms, Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect, On the recognition of permuted bottleneck Monge matrices, On the role of bottleneck Monge matrices in combinatorial optimization, Two-machine flow shop scheduling with an operator non-availability period to minimize makespan, Solving permutation flow shop scheduling problem with sequence-independent setup time, Perspectives of Monge properties in optimization, A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem, A note on the two-stage hybrid flow shop problem with dedicated machines, An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, Local search methods for the flowshop scheduling problem with flowtime minimization, Approximation schemes for two-machine flow shop scheduling with two agents, Unbounded parallel-batch scheduling with family jobs and delivery coordination, Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments, On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty, A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times, Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs, Scheduling with batching: A review, Complexity of mixed shop scheduling problems: A survey, Minimizing tardy jobs in a flowshop with common due date, Minimizing functions of infeasibilities in a two-machine flow shop, Scheduling with limited machine availability, A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements, On scheduling multiple two-stage flowshops, Flow shop for dual CPUs in dynamic voltage scaling, Minmax due-date assignment on a two-machine flowshop, Online scheduling of ordered flow shops, Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem, Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage, Flowshop scheduling problem with parallel semi-lines and final synchronization operation, A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion, Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems, Scheduling inbound and outbound trucks at cross docking terminals, The two-machine flow-shop problem with weighted late work criterion and common due date, A comprehensive review and evaluation of permutation flowshop heuristics, Two-machine flowshop batching and scheduling, 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, Metaheuristic algorithms for the hybrid flowshop scheduling problem, Two-machine flow shop scheduling problems with no-wait jobs, Two-stage production scheduling with an outsourcing option, A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem, A new heuristic for the n-job, M-machine flow-shop problem, A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems, Optimisation model for multi-item multi-echelon supply chains with nested multi-level products, Re-entrant flowshop scheduling with learning considerations to minimize the makespan, Approximation results for the two-machine job shop under limited machine availability, Coupled task scheduling with exact delays: literature review and models, Improved approximation algorithms for two-stage flowshops scheduling problem, On a flow-shop scheduling problem with fuzzy pentagonal processing time, Automatic algorithm design for hybrid flowshop scheduling problems, Approximation algorithms for two-stage flexible flow shop scheduling, Shop scheduling problems with pliable jobs, 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, The two-machine open shop problem: To fit or not to fit, that is the question, 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, Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines, Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP, Heuristics for permutation flow shop scheduling with batch setup times, Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles, Two machine mixed shop scheduling problem with controllable machine speeds, Scheduling in multi-scenario environment with an agreeable condition on job processing times, A two-machine no-wait flow shop problem with two competing agents, Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning, Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, Two models for a family of flowshop sequencing problems, Moderate exponential-time algorithms for scheduling problems, Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion, Scheduling with generalized and periodic due dates under single- and two-machine environments, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling, Two-machine flow shop scheduling with a common due date to maximize total early work, Two-machine routing open shop: How long is the optimal makespan?, Two-machine flowshop scheduling with a secondary criterion, The two-machine sequence dependent flowshop scheduling problem, A fast feasibility test for relocation problems, A two-machine flow shop scheduling problem with controllable job processing times, On no-wait and no-idle flow shops with makespan criterion, A taxonomy of flexible flow line scheduling procedures, Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time, A new approach to two-machine flow shop problem with uncertain processing times, A bicriteria flowshop scheduling problem with setup times, On relocation problems with multiple identical working crews, The two-machine flowshop scheduling problem with total tardiness, Simple heuristics for scheduling with limited intermediate storage, A new integer programming formulation for the permutation flowshop problem, k-optimal solution sets for some polynomially solvable scheduling problems, Worst-case analysis of an approximation algorithm for flow-shop scheduling, A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop, Optimal fuzzy counterparts of scheduling rules, Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, Two-machine flow shop problems with a single server, A note on the two machine job shop with the weighted late work criterion, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge, Minimizing total tardiness in permutation flowshops, Optimal lot streaming for multiple products in a two-machine flow shop, Shortest common superstrings and scheduling with coordinated starting times, Considering scheduling and preventive maintenance in the flowshop sequencing problem, Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function, Modified simulated annealing algorithms for the flow shop sequencing problem, Flowshop sequencing with mean flowtime objective, Complexity of problem \(TF2|v=1,c=2|C_{\max}\), Fast discrete consensus based on gossip for makespan minimization in networked systems, Flowshop scheduling with interstage job transportation, Optimal control of a two-server flow-shop network, An adaptive branching rule for the permutation flow-shop problem, Sequencing with general precedence constraints, The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times, Discrete extremal problems, Job sequencing with fuzzy processing times, A survey of results for sequencing problems with controllable processing times, The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem, An improved NEH-based heuristic for the permutation flowshop problem, Job lateness in a two-machine flowshop with setup times separated, Scheduling coordination problems in supply chain planning, Modeling realistic hybrid flexible flowshop scheduling problems, Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date, A bicriteria flowshop scheduling with a learning effect, An efficient heuristic approach to the scheduling of jobs in a flowshop, Approximation results for flow shop scheduling problems with machine availability constraints, Flowshop scheduling problem with a batching machine and task compatibilities, Batching and scheduling in a multi-machine flow shop, A multi-stage parallel-processor flowshop problem with minimum flowtime, Cooperative metaheuristics for the permutation flowshop scheduling problem, A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations, 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, Fuzzy job sequencing for a flow shop, Minimizing the total weighted completion time in the relocation problem, The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm, An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs, A parallel multiple reference point approach for multi-objective optimization, Throughput optimization in two-machine flowshops with flexible operations, Container sequencing for quay cranes with internal reshuffles, Flow shops with machine maintenance: ordered and proportionate cases, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Minimizing makespan in two-stage hybrid cross docking scheduling problem, Scheduling reentrant jobs on parallel machines with a remote server, Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan, Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions, Johnson's rule, composite jobs and the relocation problem, A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops, Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem, Scheduling of a single crane in batch annealing process, Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics, A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem, A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots, The two-machine total completion time flow shop problem, Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard, A genetic algorithm for flowshop scheduling with multiple objectives, The job shop scheduling problem: Conventional and new solution techniques, The generalized shifting bottleneck procedure, Scheduling arrivals to a production system in a fuzzy environment, Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times, A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines, 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, Variants of the two machine flow shop problem connected with factorization of matrix functions, Sevast'yanov's algorithm for the flow-shop scheduling problem, Genetic algorithms for the two-stage bicriteria flowshop 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, Heuristic for scheduling in a Kanban system with dual blocking mechanisms, A branch and bound algorithm for the two-stage assembly scheduling problem, Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine, The distributed permutation flowshop scheduling problem, A survey of berth allocation and quay crane scheduling problems in container terminals, Scheduling jobs under decreasing linear deterioration, Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization, Minimizing total tardiness on a two-machine re-entrant flowshop, The mixed shop scheduling problem, A multi-objective memetic algorithm for the job-shop scheduling problem, Optimizing resource speed for two-stage real-time tasks, Optimal versus heuristic scheduling of surface mount technology lines, A new lower bound for the job-shop scheduling problem, The two-machine flow shop problem with arbitrary precedence relations, Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times, A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling, A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines, Applying tabu search to the job-shop scheduling problem, Two machine open shop scheduling problem with setup, processing and removal times separated, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops, A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs, Polynomial time algorithms for the UET permutation flowshop problem with time delays, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem, Flow shop scheduling jobs with position-dependent processing times, A local search using solution fragments for the 2-machine bicriteria scheduling problem, Schedule execution for two-machine flow-shop with interval processing times, An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint, Measures of problem uncertainty for scheduling with interval processing times, On the two-stage hybrid flow shop with dedicated machines, Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms, Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence, A data intensive heuristic approach to the two-stage streaming scheduling problem, Chance-constrained model for uncertain job shop scheduling problem, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem, Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant, \(N\)-NEH+ algorithm for solving permutation flow shop problems, New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems, Exact solution of the two-machine flow shop problem with three operations, Assembly flowshop scheduling problem: speed-up procedure and computational evaluation, Exact solutions for the two-machine robust flow shop with budgeted uncertainty, A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint, Minimizing the machine processing time in a flow shop scheduling problem under piecewise quadratic fuzzy numbers, Scheduling two-stage jobs on multiple flowshops, A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops, A note on makespan minimization in two-stage flexible flow shops with uniform machines, Application of an optimization problem in max-plus algebra to scheduling problems, Vyacheslav Tanaev: contributions to scheduling and related areas, Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications, Approximations for the two-machine cross-docking flow shop problem, Some results of the worst-case analysis for flow shop scheduling with a learning effect, On index priority sequencing rules for scheduling with time-dependent job processing times, Uncertainty measure for the Bellman-Johnson problem with interval processing times, A two-machine flowshop scheduling problem with a separated maintenance constraint, A Lagrangean relaxation approach for the mixed-model flow line sequencing problem, Complexity of shop-scheduling problems with fixed number of jobs: a survey, Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times, Multi-family scheduling in a two-machine reentrant flow shop with setups, An improved NEH heuristic to minimize makespan in permutation flow shops, Scheduling a two-stage flowshop under makespan constraint, Analysis of heuristics for the UET two-machine flow shop problem with time delays, A modification to the CGPS algorithm for three-machine flow shop scheduling, An approximate solution of the flow-shop problem with sequence dependent setup times, Optimizing schedules in the pipeline systems with variable job execution order, A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint, Scheduling two-stage hybrid flow shop with availability constraints, A two-stage semi-hybrid flowshop problem in graphics processing, Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates, Two machines flow shop with reentrance and exact time lag, Minimizing the makespan in a two-machine cross-docking flow shop problem, Flow Shop for Dual CPUs in Dynamic Voltage Scaling, Su alcuni problemi di ordinamento, Heuristic for stochastic online flowshop problem with preemption penalties, Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation, On scheduling inclined jobs on multiple two-stage flowshops, Two machine scheduling problem when passing allowed, On-line and semi-online scheduling for flow shop problems on two machines, The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times, Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops, Two-machine flowshop scheduling problem with coupled-operations, Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags, Clustered flow shop models, No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, Two-machine shop scheduling: Compromise between flexibility and makespan value, Sequencing and loading of products on a flowline, Flowshop scheduling research after five decades, A new sufficient condition of optimality for the two-machine flowshop problem, Applying machine based decomposition in 2-machine flow shops, A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation, Johnson's problem with stochastic processing times and optimal service level, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, 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, A scheduling problem in the baking industry, On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time, Permutation flowshop scheduling problems with maximal and minimal time lags, FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING, DVS scheduling in a line or a star network of processors, A combination of flow shop scheduling and the shortest path problem, A cyclical search for the two machine flow shop and open shop to minimise finishing time, A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages, On some sequencing problems, Using hybrid GA-PSO algorithm to solve problem in machine scheduling, AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER, Unnamed Item, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration, 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 Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search, The flow shop problem with time lags and separated setup times, Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach, Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem, A MILP model for then-job,M-stage flowshop with sequence dependent set-up times, Inhomogeneous deterministic two-stage queueing systems, Optimal choice of machine speeds for two-stage non-homogeneous systems, Two- and three-machine flow shop scheduling problems with equal sized transfer batches, The Two-Stage Flowshop Scheduling Problem with M Machines at each Stage, On non-permutation solutions to some two machine flow shop scheduling problems, Relocation problems of maximizing new capacities under a common due date, Flowshop sequencing problems with limited buffer storage, Job-Shop Scheduling with Mixed Blocking Constraints between Operations, Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, General flow-shop scheduling with resource constraints, SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN, Minimizing Mean Completion Time for Special Flowshop Problems, Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung, The clustered flow-shop problem, Two-machine flowshop scheduling to minimize total tardiness, An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system, 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, Some new results in flow shop scheduling, Minimizing maximum lateness on one machine: computational experience and some applications, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, Reihenfolgeprobleme und Graphentheorie, An effective new heuristic algorithm for solving permutation flow shop scheduling problem, SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK, Machine scheduling with transportation considerations, A decomposition scheduling method for operating flexible manufacturing systems, A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria, Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, Design and scheduling of flexible assembly lines for printed circuit boards, A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times, Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, On the relocation problem with a second working crew for resource recycling, A flexible flowshop problem with total flow time minimization, Batch scheduling in the no-wait two-machine flowshop to minimize the makespan, The three-stage assembly flowshop scheduling problem, Real-time routing in flexible flow shops: a self-adaptive swarm-based control model, Scheduling in flowshops to minimize total tardiness of jobs, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, Scheduling experiments on a nulear reactor using mixed integer programming, Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem, 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, Two-machine open shop scheduling with an availability constraint, Auction-based approach to resolve the scheduling problem in the steel making process, Self-adaptive dynamic scheduling of virtual production systems, Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs, Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements, P2P B&B and GA for the Flow-Shop Scheduling Problem, A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays, A heuristic algorithm to schedule work in the repair industry, Lot streaming in a multiple product permutation flow shop with intermingling, Bounding the Running Time of Algorithms for Scheduling and Packing Problems, Flowshop/no-idle scheduling to minimise the mean flowtime, 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, Scheduling production tasks in a two-stage FMS, Sequencing a hybrid two-stage flowshop with dedicated machines, Stability of Johnson's schedule with respect to limited machine availability, Conceptual framework for lot-sizing and scheduling of flexible flow lines, Flowshop-scheduling problems with makespan criterion: a review, Counting and enumeration complexity with application to multicriteria scheduling, An improved branch and bound procedure for scheduling a flow line manufacturing cell, Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan, Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues, Méthode heuristique pour le problème de flow shop hybride avec machines dédiées, Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops, Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm, Scheduling of flow shop problems on 3 machines in fuzzy environment with double transport facility, TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES, Parallel flowshop scheduling using Tabu search, Sequency on two and three machines with setup, processing and removal times separated, An efficient decision making process for vehicles operations in underground mining, A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM, Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions, Performance analysis of modular products, A computational study of heuristics for two-stage flexible flowshops, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop, Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1, Special Cases With Set Up Considerations for n×3 Flowshop Problem, A Taxonomy for the Flexible Job Shop Scheduling Problem, A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect, On some lower bounds for the permutation flowshop problem, Distributed assembly permutation flow-shop scheduling problem with sequence-dependent set-up times using a novel biogeography-based optimization algorithm, An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems, Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem, A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs, Maximizing total early work in a distributed two‐machine flow‐shop, Stochastic local search and parameters recommendation: a case study on flowshop problems, Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty, Evaluating the impact of grammar complexity in automatic algorithm design, An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine, Algorithms for a two‐machine flowshop problem with jobs of two classes, Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates, Collaborative optimization of workshop layout and scheduling, Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion, Flowshop with additional resources during setups: mathematical models and a GRASP algorithm, A state-of-the-art survey on multi-scenario scheduling, Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems, Two-machine job-shop scheduling with one joint job, Firefly-Inspired Algorithm for Job Shop Scheduling, Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines, On scheduling multiple parallel two-stage flowshops with Johnson's rule, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, An improved approximation algorithm for a scheduling problem with transporter coordination, Maximizing Throughput in Flow Shop Real-Time Scheduling, Two-machine flow shops with limited machine availability, A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates., Local search heuristics for two-stage flow shop problems with secondary criterion, Minimizing tardiness in a two-machine flow-shop, Improving local search heuristics for some scheduling problems. II, On the complexity of coupled-task scheduling, A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines