Pages that link to "Item:Q1162927"
From MaRDI portal
The following pages link to The one-machine sequencing problem (Q1162927):
Displaying 50 items.
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- Preemptive scheduling with release dates, delivery times and sequence independent setup times (Q1331546) (← links)
- A decomposition approach for a resource constrained scheduling problem (Q1333515) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- Adjustment of heads and tails for the job-shop problem (Q1341994) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
- Complexity, bounds and dynamic programming algorithms for single track train scheduling (Q1730675) (← links)
- A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
- Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage (Q1762032) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Core instances for testing: a case study (Q1779532) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
- A sequencing problem with family setup times (Q1917311) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
- A novel MILP model for \(N\)-vehicle exploration problem (Q2240108) (← links)
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
- A metric approach for scheduling problems with minimizing the maximum penalty (Q2245804) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints (Q2270437) (← links)
- Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- A branch and bound algorithm for scheduling trains in a railway network (Q2371354) (← links)
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Application of an optimization problem in max-plus algebra to scheduling problems (Q2433798) (← links)
- Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
