Pages that link to "Item:Q884029"

The following pages link to On the machine scheduling problem with job delivery coordination (Q884029):

Displaying 40 items.

• Two parallel machines problem with job delivery coordination and availability constraint (Q256680) (← links)
• An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
• Bin covering with a general profit function: approximability results (Q301139) (← links)
• Heuristics for parallel machine scheduling with batch delivery consideration (Q380563) (← links)
• Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination (Q387811) (← links)
• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
• Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
• Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation (Q555434) (← links)
• An improved approximation algorithm for single machine scheduling with job delivery (Q621846) (← links)
• Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
• The coordination of single-machine scheduling with availability constraints and delivery (Q747044) (← links)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
• Scheduling with families of jobs and delivery coordination under job availability (Q1034606) (← links)
• Single machine scheduling with job delivery to multiple customers (Q1617286) (← links)
• Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
• Scheduling with job delivery coordination on single machine (Q1744622) (← links)
• Machine scheduling with job delivery coordination (Q1876146) (← links)
• Coordinating multi-location production and customer delivery (Q1936790) (← links)
• Unbounded parallel-batch scheduling with family jobs and delivery coordination (Q1944952) (← links)
• Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery (Q2039713) (← links)
• A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
• Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan (Q2296256) (← links)
• Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling (Q2310974) (← links)
• Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time (Q2342682) (← links)
• Synchronizing production and air transportation scheduling using mathematical programming models (Q2390001) (← links)
• Single machine scheduling with release dates and job delivery to minimize the makespan (Q2481956) (← links)
• Two faster algorithms for coordination of production and batch delivery: a note (Q2629739) (← links)
• Machine scheduling with job class setup and delivery considerations (Q2655964) (← links)
• Coordinated scheduling of the outsourcing, in-house production and distribution operations (Q2672061) (← links)
• Machine Scheduling with a Maintenance Interval and Job Delivery Coordination (Q3452556) (← links)
• The Coordination of Two Parallel Machines Scheduling and Batch Deliveries (Q3511379) (← links)
• SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK (Q4921478) (← links)
• PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION (Q5370785) (← links)
• Machine scheduling with pickup and delivery (Q5438533) (← links)
• (Q5469868) (← links)
• Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time (Q5964074) (← links)
• The bin covering with delivery problem, extended investigations for the online case (Q6100671) (← links)
• Flow shop scheduling problems with transportation constraints revisited (Q6185848) (← links)
• An improved approximation algorithm for a scheduling problem with transporter coordination (Q6204661) (← links)