Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Scheduling Optimization Problem: The Average Cost Case 2001-11-26 Paper A Bellman's equation for minimizing the maximum cost 2001-05-06 Paper Fast computational...
    10 bytes (18 words) - 15:17, 8 December 2023
  • mardi4nfdi.de/entity/Q4889095 1997-01-06 Paper Partitioning a matrix to minimize the maximum cost 1996-03-18 Paper Exact And Heuristic Procedures For The Traveling...
    10 bytes (16 words) - 02:51, 13 December 2023
  • 2002-10-16 Paper Partitioning a matrix with non-guillotine cuts to minimize the maximum cost 2002-09-29 Paper A new method for solving capacitated location...
    10 bytes (16 words) - 18:00, 9 December 2023
  • Average Cost Case 2001-11-26 Paper https://portal.mardi4nfdi.de/entity/Q2708892 2001-09-20 Paper A Bellman's equation for minimizing the maximum cost 2001-05-06...
    10 bytes (20 words) - 15:17, 8 December 2023
  • Pricing of Options 1990-01-01 Paper Differential games with maximum cost 1990-01-01 Paper The Bellman equation for minimizing the maximum cost 1989-01-01...
    10 bytes (18 words) - 16:22, 6 December 2023
  • Paper Computing the variance of interval and fuzzy data 2011-05-02 Paper Partitioning a matrix to minimize the maximum cost 1996-03-18 Paper Exact And Heuristic...
    10 bytes (16 words) - 09:55, 6 October 2023
  • Paper ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost 2020-01-14 Paper Scheduling...
    10 bytes (16 words) - 10:52, 6 October 2023
  • unbounded serial-batching machine 2021-10-19 Paper Hierarchical minimization of two maximum costs on a bounded serial-batching machine 2021-07-19 Paper https://portal...
    10 bytes (17 words) - 17:02, 24 September 2023
  • 2020-12-11 Paper Minimizing maximum cost for a single machine under uncertainty of processing times 2020-05-27 Paper Lawler's minmax cost problem under uncertainty...
    10 bytes (18 words) - 08:47, 9 December 2023
  • Serial-batching scheduling with two agents to minimize makespan and maximum cost 2020-12-11 Paper The recognition and prediction of \(\sigma^{70}\) promoters in \textit{Escherichia...
    10 bytes (17 words) - 17:41, 6 October 2023
  • Publication Date of Publication Type Serial-batching scheduling with two agents to minimize makespan and maximum cost 2020-12-11 Paper...
    10 bytes (16 words) - 14:22, 6 October 2023
  • Publication Date of Publication Type Fixed interval scheduling with third‐party machines 2023-12-11 Paper Minimizing maximum cost for a single machine...
    10 bytes (16 words) - 11:12, 6 October 2023
  • mardi4nfdi.de/entity/Q3869069 1981-01-01 Paper Sequencing to Minimize the Maximum Job Cost 1980-01-01 Paper On perfect graphs and polyhedra with (0, 1)-valued...
    10 bytes (19 words) - 09:10, 12 December 2023
  • Publication Date of Publication Type Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost 2019-11-12...
    10 bytes (16 words) - 10:48, 6 October 2023
  • deadline to minimize maximum compression cost 2020-04-21 Paper Models and algorithms for energy-efficient scheduling with immediate start of jobs 2019-08-08...
    10 bytes (18 words) - 00:58, 11 December 2023
  • identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines 2014-01-13 Paper Inefficiency of equilibria for the...
    10 bytes (16 words) - 05:49, 7 October 2023
  • Partitioning a matrix with non-guillotine cuts to minimize the maximum cost 2002-09-29 Paper Degree elevation of \(p\)-Bézier curves 2002-07-23 Paper https://portal...
    10 bytes (16 words) - 12:32, 8 December 2023
  • An algorithm for single machine sequencing with release dates to minimize maximum cost 1989-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3475120 1988-01-01...
    10 bytes (16 words) - 09:14, 13 December 2023
  • An algorithm for single machine sequencing with release dates to minimize maximum cost 1989-01-01 Paper Scheduling jobs on a single machine with periodic...
    10 bytes (16 words) - 23:30, 12 December 2023
  • 2020-09-01 Paper Minimizing the total cost of barrier coverage in a linear domain 2018-07-20 Paper Minimizing the Maximum Moving Cost of Interval Coverage...
    10 bytes (20 words) - 20:16, 6 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)