Pages that link to "Item:Q4696979"

The following pages link to A modified shifting bottleneck procedure for job-shop scheduling (Q4696979):

Displaying 31 items.

• Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
• A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
• A multi-criteria approach for scheduling semiconductor wafer fabrication facilities (Q835581) (← links)
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
• On the representation of the one machine sequencing problem in the shifting bottleneck heuristic (Q879326) (← links)
• Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
• A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
• Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration (Q983631) (← links)
• An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
• A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
• Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Benchmarks for shop scheduling problems (Q1296703) (← links)
• Integration of lotsizing and scheduling decisions in a job-shop (Q1331617) (← links)
• Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
• Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
• Decomposition methods for large job shops (Q1592580) (← links)
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)
• Single machine scheduling subject to precedence delays (Q2563923) (← links)
• Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
• Study on constraint scheduling algorithm for job shop problems with multiple constraint machines (Q3527958) (← links)
• (Q4238569) (← links)
• Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
• Modelling and rescheduling of a re-entrant wafer fabrication line involving machine unreliability (Q4671328) (← links)
• A modified shifting bottleneck procedure for job-shop scheduling (Q4696979) (← links)
• An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
• A note on the shifting bottleneck procedure for job shop scheduling (Q6136083) (← links)