Flowshop scheduling with limited temporary storage
From MaRDI portal
Publication:3930628
DOI10.1145/322203.322213zbMath0475.68014OpenAlexW2089810121MaRDI QIDQ3930628
Paris C. Kanellakis, Christos H. Papadimitriou
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322203.322213
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Some no-wait shops scheduling problems: Complexity aspect, Optimal versus heuristic scheduling of surface mount technology lines, Competitive production scheduling: A two-firm, noncooperative finite dynamic game, Exact train pathing, Flow-shop scheduling for three serial stations with the last two duplicate, Some complexity results in cyclic scheduling, Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines, Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study, Job-shop scheduling with limited capacity buffers, On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements, Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems, On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine, Simple heuristics for scheduling with limited intermediate storage, On non-permutation solutions to some two machine flow shop scheduling problems, The scheduling problem where multiple machines compete for a common local buffer, Flowshop sequencing problems with limited buffer storage, Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems, An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine, Unnamed Item, An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers., Solving the continuous flow-shop scheduling problem by metaheuristics., Quantity-based buffer-constrained two-machine flowshop problem: active and passive prefetch models for multimedia applications, Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times., Improved bounded dynamic programming algorithm for solving the blocking flow shop problem, Batch scheduling in a two-machine flow shop with limited buffer, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, Some new results in flow shop scheduling, Fitness landscape analysis for the no-wait flow-shop scheduling problem, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations, Scheduling batches in flowshop with limited buffers in the shampoo industry, Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, On the high multiplicity traveling salesman problem, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, Complexity of single machine scheduling subject to nonnegative inventory constraints, No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem, Minimizing total completion time in two-machine flow shops with exact delays, Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, Scheduling production tasks in a two-stage FMS, Flowshop-scheduling problems with makespan criterion: a review, The evolution of schematic representations of flow shop scheduling problems, A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE, Cyclic scheduling in 3-machine robotic flow shops, A two-machine permutation flow shop scheduling problem with buffers, Approximation scheduling algorithms: a survey, Minimizing makespan in a pallet-constrained flowshop, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, A review of TSP based approaches for flowshop scheduling, Complexity of flowshop scheduling problems with a new blocking constraint, Job-shop scheduling with blocking and no-wait constraints, Two-machine group scheduling problem with blocking and anticipatory setups, The complexity of scheduling jobs in repetitive manufacturing systems, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
