Pages that link to "Item:Q1584823"

The following pages link to Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823):

Displaying 29 items.

• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
• A hybrid policy for order acceptance in batch process industries (Q850653) (← links)
• Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
• Heuristics for search sequencing under time-dependent probabilities of existence (Q868139) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← links)
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry (Q992661) (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
• Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
• On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) (← links)
• A heuristic to schedule flexible job-shop in a glass factory (Q1772853) (← links)
• Makespan estimation in batch process industries: A comparison between regression analysis and neural networks (Q1869422) (← links)
• An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs (Q2225197) (← links)
• A hybrid method for large-scale short-term scheduling of make-and-pack production processes (Q2356282) (← links)
• Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
• Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
• No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
• An evolutionary approach to rehabilitation patient scheduling: A case study (Q2482797) (← links)
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups (Q2642312) (← links)
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502) (← links)
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
• A multi-echelon integrated JIT inventory model using the time buffer and emergency borrowing policies to deal with random delivery lead times (Q4474667) (← links)
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem (Q5059236) (← links)
• Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm (Q5259763) (← links)