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 method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Developing feasible and optimal schedules of jobs on one machine (Q380659) (← links)
- Resource leveling in a machine environment (Q418090) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Local adjustments: A general algorithm (Q707084) (← links)
- Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- New directions in scheduling theory (Q786649) (← links)
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- A robust approach for the single machine scheduling problem (Q835547) (← links)
- Job shop scheduling with setup times, deadlines and precedence constraints (Q835609) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634) (← 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)
- New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- On single-machine scheduling without intermediate delays (Q955319) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
- \texttt{Absalom}: balancing assembly lines with assignment restrictions (Q1044086) (← links)
- A note on minimizing maximum lateness in a one-machine sequencing problem with release dates (Q1065705) (← links)
- A block approach for single-machine scheduling with release dates and due dates (Q1083026) (← links)
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256) (← links)
- An algorithm for single machine sequencing with release dates to minimize maximum cost (Q1121165) (← links)
- A procedure for the one-machine sequencing problem with dependent jobs (Q1130073) (← links)
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis (Q1186948) (← links)
- Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- One-machine rescheduling heuristics with efficiency and stability as criteria (Q1201849) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- Time lag size in multiple operations flow shop scheduling heuristics (Q1291707) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times (Q1319563) (← links)
