The following pages link to (Q4055377):
Displaying 50 items.
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Minimization of the maximal lateness for a single machine (Q329086) (← links)
- Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling (Q337595) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (Q342173) (← links)
- Bi-criteria single machine scheduling with a time-dependent learning effect and release times (Q345517) (← links)
- On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
- EA/G-GA for single machine scheduling problems with earliness/tardiness costs (Q400876) (← links)
- Production scheduling with alternative process plans (Q439374) (← links)
- An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective (Q439458) (← links)
- Single-machine scheduling with past-sequence-dependent delivery times and release times (Q456143) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times (Q611469) (← links)
- Scheduling problems with partially ordered jobs (Q612206) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems (Q613776) (← links)
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← links)
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684) (← links)
- On-line scheduling to minimize average completion time revisited. (Q703266) (← links)
- Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties (Q838299) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- A tabu search algorithm for the single machine total weighted tardiness problem (Q853020) (← links)
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
- Scheduling on parallel identical machines to minimize total tardiness (Q856206) (← links)
- Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201) (← links)
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date (Q861263) (← links)
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- Scheduling unrelated parallel machines with sequence-dependent setups (Q883307) (← links)
- A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem (Q909574) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times (Q941536) (← links)
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
