An algorithm for the maximum revenue jobshop problem (Q958087): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2007.11.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2162953579
@@ Property / OpenAlex ID: W2162953579 / rank @@
+Normal rank
@@ Property / cites work @@
+The Shifting Bottleneck Procedure for Job Shop Scheduling
+Normal rank
@@ Property / cites work @@
+Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
+Normal rank
@@ Property / cites work @@
+From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective
+Normal rank
@@ Property / cites work @@
+From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
+Normal rank
@@ Property / cites work @@
+Scheduling jobshops with some identical or similar jobs
+Normal rank
@@ Property / cites work @@
+A Fluid Heuristic for Minimizing Makespan in Job Shops
+Normal rank
@@ Property / cites work @@
+Q4471274
@@ Property / cites work: Q4471274 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of cyclic shop scheduling problems
@@ Property / cites work: The complexity of cyclic shop scheduling problems / rank @@
+Normal rank
@@ Property / cites work @@
+Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
+Normal rank
@@ Property / cites work @@
+The complexity of scheduling jobs in repetitive manufacturing systems
+Normal rank
@@ Property / cites work @@
+Performance Measures and Schedules in Periodic Job Shops
+Normal rank
@@ Property / cites work @@
+A simplex based algorithm to solve separated continuous linear programs
+Normal rank