Jump to content

Job-shop scheduling: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

24 March 2025

19 March 2025

17 March 2025

21 August 2024

20 August 2024

16 July 2024

26 January 2024

7 December 2023

3 December 2023

25 September 2023

10 January 2023

9 September 2022

16 June 2022

4 May 2022

  • curprev 13:5613:56, 4 May 2022 EricBilll21 talk contribs m 18,862 bytes +14 The article is telling us that for m > 2, this problem is np-complete. Which for one part means that there exists an algorithm solving the problem in polynomial time but nondeterministically ( NP is the class of all problems that can be solved in nondeterministic polynomial time). In order not to confuse the reader, I added the word 'deterministic'. pe undo

18 February 2022

17 December 2021

2 September 2021

5 July 2021

26 June 2021

25 June 2021

23 June 2021

19 June 2021

18 June 2021

12 June 2021

11 January 2021

7 January 2021

6 December 2020

25 October 2020

23 October 2020

4 September 2020

31 July 2020

17 April 2020

16 April 2020

13 February 2020

18 November 2019

18 October 2019

22 September 2019

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)