Pages that link to "Item:Q4131996"
From MaRDI portal
The following pages link to A dual algorithm for the one-machine scheduling problem (Q4131996):
Displaying 50 items.
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A two-machine flowshop problem with two agents (Q709115) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems (Q858325) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem (Q928082) (← links)
- Dynamic programming and decomposition approaches for the single machine total tardiness problem (Q1092805) (← links)
- The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- A neural network model for scheduling problems (Q1268160) (← links)
- A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192) (← links)
- Single machine earliness and tardiness scheduling (Q1278531) (← links)
- A heuristic for the single machine tardiness problem (Q1310015) (← links)
- Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
- A greedy heuristic for the mean tardiness sequencing problem (Q1317079) (← links)
- Decomposition of the single machine total tardiness problem (Q1362989) (← links)
- A new lower bounding scheme for the total weighted tardiness problem. (Q1406617) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- A two-machine flowshop scheduling problem with precedence constraint on two jobs (Q1701710) (← 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)
- A decomposition algorithm for the single machine total tardiness problem (Q1838424) (← links)
- Minimizing the sum of squares lateness on a single machine (Q1848630) (← links)
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence (Q1892667) (← links)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- Rescheduling problems with allowing for the unexpected new jobs arrival (Q2125233) (← links)
- Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
- Chance-constrained model for uncertain job shop scheduling problem (Q2403327) (← links)
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm (Q2403558) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs (Q2638922) (← links)
- Bicriteria scheduling with vacations on a single machine (Q2997965) (← links)
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit (Q3313596) (← links)
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering (Q3416015) (← links)
