Minimizing L max for the single machine scheduling problem with family set-ups (Q4671323): Difference between revisions

@@ 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.1080/00207540410001716561
+Normal rank
@@ Property / OpenAlex ID @@
+W1985556167
@@ Property / OpenAlex ID: W1985556167 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4943562
@@ Property / cites work: Q4943562 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness with job families
@@ Property / cites work: Minimizing maximum lateness with job families / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with batch set-up times to minimize maximum lateness
+Normal rank
@@ Property / cites work @@
+On the Complexity of Scheduling with Batch Setup Times
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
+Normal rank
@@ Property / cites work @@
+Scheduling Groups of Jobs on a Single Machine
@@ Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank @@
+Normal rank

Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups (Q4671323): Difference between revisions