The prize-collecting scheduling problem with deadlines (Q510929): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2016.10.015
@@ Property / DOI: 10.1016/j.endm.2016.10.015 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2016.10.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2549642359
@@ Property / OpenAlex ID: W2549642359 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Machine Scheduling by Column Generation
@@ Property / cites work: Parallel Machine Scheduling by Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on offline scheduling with rejection
@@ Property / cites work: A survey on offline scheduling with rejection / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the Pareto-optima for the total and maximum tardiness single machine problem
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2016.10.015
@@ Property / DOI: 10.1016/J.ENDM.2016.10.015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:510929