Economically-augmented job shop scheduling

We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its significance in modern organizational supply-web structures, analyze its complexity and present a specific type of combinatorial auctions as a solution mechanism. We relate EJSP to results from the area of economic mechanism design and especially emphasize the need for solution mechanisms, which give the agents no incentive to lie. This requirement is a significant extension to the side constraints that are usually considered in the scheduling literature