Flowshop scheduling with limited temporary storage
From MaRDI portal
Publication:3930628
DOI10.1145/322203.322213zbMath0475.68014MaRDI QIDQ3930628
Christos H. Papadimitriou, Paris C. Kanellakis
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
68Q25: Analysis of algorithms and problem complexity
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
On non-permutation solutions to some two machine flow shop scheduling problems, Scheduling production tasks in a two-stage FMS, Influence of capacity- and time-constrained intermediate storage in two-stage food production systems, Flowshop-scheduling problems with makespan criterion: a review, Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays, Batch scheduling in a two-machine flow shop with limited buffer, A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking, Exact train pathing, Job-shop scheduling with limited capacity buffers, Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems, Simple heuristics for scheduling with limited intermediate storage, An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers, A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations, Complexity of single machine scheduling subject to nonnegative inventory constraints, Minimizing total completion time in two-machine flow shops with exact delays, Some no-wait shops scheduling problems: Complexity aspect, The scheduling problem where multiple machines compete for a common local buffer, Cyclic scheduling in 3-machine robotic flow shops, A two-machine permutation flow shop scheduling problem with buffers, Minimizing makespan in a pallet-constrained flowshop, Two-machine group scheduling problem with blocking and anticipatory setups, The complexity of scheduling jobs in repetitive manufacturing systems, Some complexity results in cyclic scheduling, An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers., Solving the continuous flow-shop scheduling problem by metaheuristics., Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times., Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds, Job-shop scheduling with blocking and no-wait constraints, Flow-shop scheduling for three serial stations with the last two duplicate, Competitive production scheduling: A two-firm, noncooperative finite dynamic game, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, On the high multiplicity traveling salesman problem, A review of TSP based approaches for flowshop scheduling, Complexity of flowshop scheduling problems with a new blocking constraint, Optimal versus heuristic scheduling of surface mount technology lines, Unnamed Item, Some new results in flow shop scheduling, Flowshop sequencing problems with limited buffer storage, An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers, A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE, Approximation scheduling algorithms: a survey
