Search results
From MaRDI portal
- Publication Date of Publication Type A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. 2003-10-14...10 bytes (18 words) - 01:18, 13 December 2023
- Publication Date of Publication Type A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. 2003-10-14...10 bytes (18 words) - 17:24, 24 September 2023
- heuristics to minimize makespan 2005-11-04 Paper Flexible flow shop scheduling with uniform parallel machines 2005-10-17 Paper Makespan minimization on uniform...10 bytes (18 words) - 15:25, 6 December 2023
- heuristics to minimize makespan 2005-11-04 Paper Flexible flow shop scheduling with uniform parallel machines 2005-10-17 Paper Makespan minimization on uniform...10 bytes (18 words) - 15:25, 6 December 2023
- Paper Determining minimal cuts with a minimal number of arcs 1982-01-01 Paper A note on weighted minimal cost flows 1981-01-01 Paper Minimal cost flows in...10 bytes (19 words) - 13:32, 8 December 2023
- performance measures on two batch processing machines 2003-05-19 Paper Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed 2002-05-20 Paper...10 bytes (18 words) - 00:19, 9 December 2023
- uncertainty 2023-06-28 Paper Parameterized complexity of computing maximum minimal blocking and hitting sets 2023-02-16 Paper https://portal.mardi4nfdi.de/entity/Q5875534...10 bytes (16 words) - 23:41, 9 December 2023
- 2009-04-14 Paper Scheduling two-machine no-wait open shops to minimize makespan 2005-02-09 Paper The total completion time open shop scheduling problem...10 bytes (17 words) - 21:54, 12 December 2023
- Publication Date of Publication Type A genetic algorithm to minimize the makespan in a two-machine cross-docking flow shop problem 2021-01-28 Paper A branch...10 bytes (16 words) - 22:47, 24 September 2023
- tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags 2017-05-31 Paper No-Wait Scheduling Problems with Batching Machines...10 bytes (16 words) - 22:03, 12 December 2023
- 2016-10-07 Paper The two-machine no-wait general and proportionate open shop makespan problem 2016-06-23 Paper A note on the complexity of scheduling problems...10 bytes (18 words) - 16:20, 10 December 2023
- Publication Type Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives 2020-05-05 Paper Two-agent scheduling with...10 bytes (17 words) - 18:14, 11 December 2023
- 1993-01-16 Paper On-line computation of minimal and maximal length paths 1992-06-28 Paper Incremental algorithms for minimal length paths 1992-06-28 Paper https://portal...10 bytes (18 words) - 03:31, 9 December 2023
- 2000-01-11 Paper https://portal.mardi4nfdi.de/entity/Q4252045 1999-06-17 Paper Makespan minimization in open shops: A polynomial time approximation scheme 1999-06-03...10 bytes (17 words) - 16:04, 9 December 2023
- mardi4nfdi.de/entity/Q5708549 2005-11-18 Paper On the generation of circuits and minimal forbidden sets 2005-03-17 Paper Scheduling with AND/OR Precedence Constraints...10 bytes (16 words) - 16:33, 24 September 2023
- an exact algorithm 2013-02-18 Paper An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence...10 bytes (16 words) - 20:44, 9 December 2023
- limited makespan 2023-08-31 Paper Reasoning about strong inconsistency in ASP 2021-04-07 Paper On computing the union of MUSes 2020-05-20 Paper Minimal sets...10 bytes (16 words) - 16:17, 6 October 2023
- gradient projection method 1987-01-01 Paper Steiner minimal trees for bar waves 1987-01-01 Paper Steiner minimal trees on sets of four points 1987-01-01 Paper...10 bytes (19 words) - 17:50, 7 December 2023
- for the multi-mode resource-constrained project scheduling problem with minimal and maximal time lags 2019-03-26 Paper An automatic multilevel image thresholding...10 bytes (17 words) - 10:55, 24 September 2023
- sizes to minimize makespan 2009-05-04 Paper An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan 2009-03-03 Paper https://portal...10 bytes (16 words) - 15:35, 6 October 2023
