Pages that link to "Item:Q3778528"
From MaRDI portal
The following pages link to The Shifting Bottleneck Procedure for Job Shop Scheduling (Q3778528):
Displaying 48 items.
- A game-theoretic control approach for job shops in the presence of disruptions (Q4394284) (← links)
- Managing a two-bottleneck job shop with a two-machine flow shop algorithm (Q4394369) (← links)
- A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling (Q4398900) (← links)
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach (Q4398998) (← links)
- Alternative graph formulation for solving complex factory-scheduling problems (Q4415989) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Scheduling of wafer test processes in semiconductor manufacturing (Q4474714) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4474722) (← links)
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM (Q4483536) (← links)
- A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937) (← links)
- Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability (Q4671328) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- Heuristics for minimizing total weighted tardiness in complex job shops (Q4681151) (← links)
- A modified shifting bottleneck procedure for job-shop scheduling (Q4696979) (← links)
- New Rollout Algorithms for Combinatorial Optimization Problems (Q4709749) (← links)
- Machine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study (Q4717125) (← links)
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments (Q4823493) (← links)
- SUPPLY CHAIN MODELED AS A METABOLIC PATHWAY (Q4959404) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- (Q5020564) (← links)
- Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling (Q5038465) (← links)
- An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
- A Taxonomy for the Flexible Job Shop Scheduling Problem (Q5270504) (← links)
- An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment (Q5391876) (← links)
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
- Using real options analysis to value reoptimization options in the shifting bottleneck heuristic (Q5438527) (← links)
- Determination of batch size at a bottleneck machine in manufacturing systems (Q5444487) (← links)
- Lot streaming in a multiple product permutation flow shop with intermingling (Q5444605) (← links)
- A genetic algorithm-based approach to machine assignment problem (Q5466733) (← links)
- An tentative taboo search algorithm for job shop scheduling (Q5492513) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
- A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time (Q6048213) (← links)
- A spatial pyramid pooling-based deep reinforcement learning model for dynamic job-shop scheduling problem (Q6068734) (← links)
- Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem (Q6106559) (← links)
- Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
- A note on the shifting bottleneck procedure for job shop scheduling (Q6136083) (← links)
- Firefly-Inspired Algorithm for Job Shop Scheduling (Q6163642) (← links)
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem (Q6164353) (← links)
- Improving branch and bound for jobshop scheduling with constraint propagation (Q6567676) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns (Q6588509) (← links)
- An intensification approach based on fitness landscape characteristics for job shop scheduling problem (Q6645165) (← links)
- An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems (Q6659821) (← links)
