Model formulations for the machine scheduling problem with limited waiting time constraints (Q3429070): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02522667.2006.10699688
+Normal rank
@@ Property / OpenAlex ID @@
+W2152924655
@@ Property / OpenAlex ID: W2152924655 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical programming formulations for machine scheduling: A survey
+Normal rank
@@ Property / cites work @@
+Two-machine flow shop scheduling problems with no-wait jobs
+Normal rank
@@ Property / cites work @@
+Q3938812
@@ Property / cites work: Q3938812 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling two-machine no-wait open shops to minimize makespan
+Normal rank
@@ Property / cites work @@
+A study of integer programming formulations for scheduling problems
+Normal rank
@@ Property / cites work @@
+Approximative procedures for no-wait job shop scheduling.
+Normal rank
@@ Property / cites work @@
+No-wait or no-idle permutation flowshop scheduling with dominating machines
+Normal rank
@@ Property / cites work @@
+Inapproximability results for no-wait job shop scheduling.
+Normal rank